Base | Representation |
---|---|
bin | 11101110010000100001… |
… | …10110111000110000000 |
3 | 10121211100022202201210112 |
4 | 32321002012313012000 |
5 | 113231220143424412 |
6 | 2102034104450452 |
7 | 133634415425360 |
oct | 16710206670600 |
9 | 3554308681715 |
10 | 1023311311232 |
11 | 364a90615071 |
12 | 1463a8a79a28 |
13 | 756619b6122 |
14 | 377584109a0 |
15 | 1b94306b722 |
hex | ee421b7180 |
1023311311232 has 64 divisors (see below), whose sum is σ = 2333397369600. Its totient is φ = 437896241664.
The previous prime is 1023311311219. The next prime is 1023311311291. The reversal of 1023311311232 is 2321131133201.
It is a tau number, because it is divible by the number of its divisors (64).
It is a junction number, because it is equal to n+sod(n) for n = 1023311311198 and 1023311311207.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 276068 + ... + 1456995.
It is an arithmetic number, because the mean of its divisors is an integer number (36459333900).
Almost surely, 21023311311232 is an apocalyptic number.
It is an amenable number.
1023311311232 is an abundant number, since it is smaller than the sum of its proper divisors (1310086058368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1023311311232 is an equidigital number, since it uses as much as digits as its factorization.
1023311311232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1733743 (or 1733731 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 1023311311232 its reverse (2321131133201), we get a palindrome (3344442444433).
The spelling of 1023311311232 in words is "one trillion, twenty-three billion, three hundred eleven million, three hundred eleven thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •