Base | Representation |
---|---|
bin | 10110111110001011100001… |
… | …011100111111011110001000 |
3 | 111020201101002122001221121012 |
4 | 112332023201130333132020 |
5 | 101220233421310210440 |
6 | 554512313122103052 |
7 | 30165114443030135 |
oct | 2676134134773610 |
9 | 436641078057535 |
10 | 101030003210120 |
11 | 2a211646a68996 |
12 | b3b835b7aaa88 |
13 | 444b11c35ba4a |
14 | 1ad3c41c9b58c |
15 | ba3050095e65 |
hex | 5be2e173f788 |
101030003210120 has 128 divisors (see below), whose sum is σ = 229172552955360. Its totient is φ = 40083194511360.
The previous prime is 101030003210113. The next prime is 101030003210161. The reversal of 101030003210120 is 21012300030101.
It can be written as a sum of positive squares in 16 ways, for example, as 153330197476 + 100876673012644 = 391574^2 + 10043738^2 .
It is a junction number, because it is equal to n+sod(n) for n = 101030003210095 and 101030003210104.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10249564232 + ... + 10249574088.
Almost surely, 2101030003210120 is an apocalyptic number.
101030003210120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101030003210120 is an abundant number, since it is smaller than the sum of its proper divisors (128142549745240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101030003210120 is a wasteful number, since it uses less digits than its factorization.
101030003210120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12763 (or 12759 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 101030003210120 its reverse (21012300030101), we get a palindrome (122042303240221).
The spelling of 101030003210120 in words is "one hundred one trillion, thirty billion, three million, two hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •