Base | Representation |
---|---|
bin | 10110110010010001111001… |
… | …001100010011101111100000 |
3 | 111010211012020020021122202111 |
4 | 112302101321030103233200 |
5 | 101113334101304020000 |
6 | 553044504232125104 |
7 | 30052043663224264 |
oct | 2662217114235740 |
9 | 433735206248674 |
10 | 100212210220000 |
11 | 29a2683a16238a |
12 | b2a596a536794 |
13 | 43bbc81021968 |
14 | 1aa64227d40a4 |
15 | b8bb39b8bcba |
hex | 5b2479313be0 |
100212210220000 has 120 divisors (see below), whose sum is σ = 247899161181672. Its totient is φ = 39863419200000.
The previous prime is 100212210219997. The next prime is 100212210220007. The reversal of 100212210220000 is 22012212001.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100212210220007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 10221466 + ... + 17461465.
Almost surely, 2100212210220000 is an apocalyptic number.
100212210220000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100212210220000 is an abundant number, since it is smaller than the sum of its proper divisors (147686950961672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100212210220000 is an equidigital number, since it uses as much as digits as its factorization.
100212210220000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27683142 (or 27683119 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 100212210220000 its reverse (22012212001), we get a palindrome (100234222432001).
The spelling of 100212210220000 in words is "one hundred trillion, two hundred twelve billion, two hundred ten million, two hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •