Base | Representation |
---|---|
bin | 10010111010101111000… |
… | …00100000100001111101 |
3 | 2022010210012002220020110 |
4 | 21131113200200201331 |
5 | 41122204044420331 |
6 | 1214335403340233 |
7 | 64650544356252 |
oct | 11352740404175 |
9 | 2263705086213 |
10 | 650008201341 |
11 | 230737758414 |
12 | a5b86521679 |
13 | 493ac30c1a5 |
14 | 23663b0b429 |
15 | 11d952d2946 |
hex | 975782087d |
650008201341 has 4 divisors (see below), whose sum is σ = 866677601792. Its totient is φ = 433338800892.
The previous prime is 650008201327. The next prime is 650008201387. The reversal of 650008201341 is 143102800056.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 650008201341 - 25 = 650008201309 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 650008201299 and 650008201308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (650008201391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 108334700221 + ... + 108334700226.
It is an arithmetic number, because the mean of its divisors is an integer number (216669400448).
Almost surely, 2650008201341 is an apocalyptic number.
It is an amenable number.
650008201341 is a deficient number, since it is larger than the sum of its proper divisors (216669400451).
650008201341 is a wasteful number, since it uses less digits than its factorization.
650008201341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 216669400450.
The product of its (nonzero) digits is 5760, while the sum is 30.
The spelling of 650008201341 in words is "six hundred fifty billion, eight million, two hundred one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.166 sec. • engine limits •