Base | Representation |
---|---|
bin | 11101110001111010110… |
… | …01011111111011100100 |
3 | 10121211010211010002212110 |
4 | 32320331121133323210 |
5 | 113231034432423022 |
6 | 2102022203321020 |
7 | 133632436065132 |
oct | 16707531377344 |
9 | 3554124102773 |
10 | 1023232311012 |
11 | 364a4aa6702a |
12 | 146386520170 |
13 | 7564b515b32 |
14 | 3774bb28752 |
15 | 1b93b16400c |
hex | ee3d65fee4 |
1023232311012 has 12 divisors (see below), whose sum is σ = 2387542059056. Its totient is φ = 341077437000.
The previous prime is 1023232311011. The next prime is 1023232311077. The reversal of 1023232311012 is 2101132323201.
It is a tau number, because it is divible by the number of its divisors (12).
It is a self number, because there is not a number n which added to its sum of digits gives 1023232311012.
It is not an unprimeable number, because it can be changed into a prime (1023232311011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 42634679614 + ... + 42634679637.
Almost surely, 21023232311012 is an apocalyptic number.
1023232311012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1023232311012 is an abundant number, since it is smaller than the sum of its proper divisors (1364309748044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1023232311012 is a wasteful number, since it uses less digits than its factorization.
1023232311012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 85269359258 (or 85269359256 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1023232311012 its reverse (2101132323201), we get a palindrome (3124364634213).
The spelling of 1023232311012 in words is "one trillion, twenty-three billion, two hundred thirty-two million, three hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •