Base | Representation |
---|---|
bin | 10111001100010011001100… |
… | …010100101001101111001110 |
3 | 111101011010122001221122002022 |
4 | 113030103030110221233032 |
5 | 101332133114143430220 |
6 | 1000534143544130142 |
7 | 30325164541560416 |
oct | 2714231424515716 |
9 | 441133561848068 |
10 | 102000311311310 |
11 | 2a5560a8657835 |
12 | b534415a66952 |
13 | 44bb785038799 |
14 | 1b28bacb7b646 |
15 | bbd3dec92925 |
hex | 5cc4cc529bce |
102000311311310 has 128 divisors (see below), whose sum is σ = 204461615232000. Its totient is φ = 36439624488960.
The previous prime is 102000311311267. The next prime is 102000311311321. The reversal of 102000311311310 is 13113113000201.
It is a super-2 number, since 2×1020003113113102 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 750491741 + ... + 750627639.
It is an arithmetic number, because the mean of its divisors is an integer number (1597356369000).
Almost surely, 2102000311311310 is an apocalyptic number.
102000311311310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102000311311310 is an abundant number, since it is smaller than the sum of its proper divisors (102461303920690).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102000311311310 is a wasteful number, since it uses less digits than its factorization.
102000311311310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 137466.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 102000311311310 its reverse (13113113000201), we get a palindrome (115113424311511).
The spelling of 102000311311310 in words is "one hundred two trillion, three hundred eleven million, three hundred eleven thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •