Base | Representation |
---|---|
bin | 11101101110001000111… |
… | …01000110011101000100 |
3 | 10121121220102000012102220 |
4 | 32313010131012131010 |
5 | 113212411010241400 |
6 | 2101045000532340 |
7 | 133531240036641 |
oct | 16670435063504 |
9 | 3547812005386 |
10 | 1021203212100 |
11 | 3640a9654a85 |
12 | 145abaa810b0 |
13 | 753b70209a6 |
14 | 375d8456dc8 |
15 | 1b86ce547a0 |
hex | edc4746744 |
1021203212100 has 72 divisors (see below), whose sum is σ = 3049993621248. Its totient is φ = 263536310400.
The previous prime is 1021203212059. The next prime is 1021203212119. The reversal of 1021203212100 is 12123021201.
1021203212100 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1021203212100.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 54894099 + ... + 54912698.
Almost surely, 21021203212100 is an apocalyptic number.
1021203212100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1021203212100 is an abundant number, since it is smaller than the sum of its proper divisors (2028790409148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1021203212100 is a wasteful number, since it uses less digits than its factorization.
1021203212100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 109806845 (or 109806838 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1021203212100 its reverse (12123021201), we get a palindrome (1033326233301).
The spelling of 1021203212100 in words is "one trillion, twenty-one billion, two hundred three million, two hundred twelve thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •