Base | Representation |
---|---|
bin | 1001010100000011110010… |
… | …1011001111101110100000 |
3 | 1100020221210112112210112010 |
4 | 2111000330223033232200 |
5 | 2320233432310100412 |
6 | 33440143033232520 |
7 | 2104555124601042 |
oct | 225007453175640 |
9 | 40227715483463 |
10 | 10240220003232 |
11 | 3298942258a0a |
12 | 1194758b62740 |
13 | 593857c98c7b |
14 | 2758b4ac9a92 |
15 | 12b58935a33c |
hex | 9503cacfba0 |
10240220003232 has 96 divisors (see below), whose sum is σ = 26943952093632. Its totient is φ = 3405368623104.
The previous prime is 10240220003207. The next prime is 10240220003269. The reversal of 10240220003232 is 23230002204201.
It is a tau number, because it is divible by the number of its divisors (96).
It is a junction number, because it is equal to n+sod(n) for n = 10240220003199 and 10240220003208.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 69553248 + ... + 69700320.
It is an arithmetic number, because the mean of its divisors is an integer number (280666167642).
Almost surely, 210240220003232 is an apocalyptic number.
10240220003232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10240220003232 is an abundant number, since it is smaller than the sum of its proper divisors (16703732090400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10240220003232 is a wasteful number, since it uses less digits than its factorization.
10240220003232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148790 (or 148782 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 21.
Adding to 10240220003232 its reverse (23230002204201), we get a palindrome (33470222207433).
The spelling of 10240220003232 in words is "ten trillion, two hundred forty billion, two hundred twenty million, three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •