Base | Representation |
---|---|
bin | 10110110010001111110110… |
… | …101101111001111101101011 |
3 | 111010210222120200021112022112 |
4 | 112302033312231321331223 |
5 | 101113320110412241021 |
6 | 553043503114112535 |
7 | 30051635513035634 |
oct | 2662176655717553 |
9 | 433728520245275 |
10 | 100210021212011 |
11 | 29a25916560277 |
12 | b2a545941b74b |
13 | 43bb9c266b569 |
14 | 1aa6295bb888b |
15 | b8ba5c8e1d5b |
hex | 5b23f6b79f6b |
100210021212011 has 8 divisors (see below), whose sum is σ = 100714100928000. Its totient is φ = 99705946614120.
The previous prime is 100210021212001. The next prime is 100210021212061. The reversal of 100210021212011 is 110212120012001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100210021212011 - 230 = 100208947470187 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100210021212001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 41579360 + ... + 43923378.
It is an arithmetic number, because the mean of its divisors is an integer number (12589262616000).
Almost surely, 2100210021212011 is an apocalyptic number.
100210021212011 is a deficient number, since it is larger than the sum of its proper divisors (504079715989).
100210021212011 is a wasteful number, since it uses less digits than its factorization.
100210021212011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2559049.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 100210021212011 its reverse (110212120012001), we get a palindrome (210422141224012).
The spelling of 100210021212011 in words is "one hundred trillion, two hundred ten billion, twenty-one million, two hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •