Base | Representation |
---|---|
bin | 10010101000101010111… |
… | …01010000111100101001 |
3 | 2021012202022110022222021 |
4 | 21110111131100330221 |
5 | 40442323342321413 |
6 | 1210053204024441 |
7 | 64155324135310 |
oct | 11242535207451 |
9 | 2235668408867 |
10 | 640310120233 |
11 | 227610408553 |
12 | a411a692121 |
13 | 484c5042064 |
14 | 22dc3adb277 |
15 | 119c8bb218d |
hex | 9515750f29 |
640310120233 has 8 divisors (see below), whose sum is σ = 738258951168. Its totient is φ = 543980278464.
The previous prime is 640310120183. The next prime is 640310120267. The reversal of 640310120233 is 332021013046.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 640310120233 - 233 = 631720185641 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 640310120198 and 640310120207.
It is not an unprimeable number, because it can be changed into a prime (640310130233) 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 7 ways as a sum of consecutive naturals, for example, 404746441 + ... + 404748022.
It is an arithmetic number, because the mean of its divisors is an integer number (92282368896).
Almost surely, 2640310120233 is an apocalyptic number.
It is an amenable number.
640310120233 is a deficient number, since it is larger than the sum of its proper divisors (97948830935).
640310120233 is a wasteful number, since it uses less digits than its factorization.
640310120233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 809494583.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 640310120233 its reverse (332021013046), we get a palindrome (972331133279).
The spelling of 640310120233 in words is "six hundred forty billion, three hundred ten million, one hundred twenty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •