Base | Representation |
---|---|
bin | 10111001100011111010011… |
… | …001110110001001011100100 |
3 | 111101012101012010020200222020 |
4 | 113030133103032301023210 |
5 | 101332341230400030312 |
6 | 1000544134004303140 |
7 | 30326134654546446 |
oct | 2714372316611344 |
9 | 441171163220866 |
10 | 102013312111332 |
11 | 2a56066a229266 |
12 | b536a439a1ab0 |
13 | 44bca7762a66b |
14 | 1b29683674496 |
15 | bbd90130178c |
hex | 5cc7d33b12e4 |
102013312111332 has 48 divisors (see below), whose sum is σ = 238088691456000. Its totient is φ = 33996205585440.
The previous prime is 102013312111279. The next prime is 102013312111369. The reversal of 102013312111332 is 233111213310201.
It is a super-2 number, since 2×1020133121113322 (a number of 29 digits) contains 22 as substring.
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, 893237169 + ... + 893351367.
It is an arithmetic number, because the mean of its divisors is an integer number (4960181072000).
Almost surely, 2102013312111332 is an apocalyptic number.
102013312111332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102013312111332 is an abundant number, since it is smaller than the sum of its proper divisors (136075379344668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102013312111332 is a wasteful number, since it uses less digits than its factorization.
102013312111332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131576 (or 131574 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 102013312111332 its reverse (233111213310201), we get a palindrome (335124525421533).
The spelling of 102013312111332 in words is "one hundred two trillion, thirteen billion, three hundred twelve million, one hundred eleven thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •