Base | Representation |
---|---|
bin | 10110110010000110101110… |
… | …101000111000101101011011 |
3 | 111010210001021202100002021211 |
4 | 112302012232220320231123 |
5 | 101113140023313031021 |
6 | 553035202503043551 |
7 | 30051140624111365 |
oct | 2662065650705533 |
9 | 433701252302254 |
10 | 100200222002011 |
11 | 29a2174811880a |
12 | b2a35837405b7 |
13 | 43baac0453b51 |
14 | 1aa5a065a1d35 |
15 | b8b6874973e1 |
hex | 5b21aea38b5b |
100200222002011 has 8 divisors (see below), whose sum is σ = 102719980005104. Its totient is φ = 97689078557280.
The previous prime is 100200222002003. The next prime is 100200222002029. The reversal of 100200222002011 is 110200222002001.
It is a happy number.
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 100200222002011 - 23 = 100200222002003 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100200222001982 and 100200222002000.
It is not an unprimeable number, because it can be changed into a prime (100200222005011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2153616036 + ... + 2153662561.
It is an arithmetic number, because the mean of its divisors is an integer number (12839997500638).
Almost surely, 2100200222002011 is an apocalyptic number.
100200222002011 is a deficient number, since it is larger than the sum of its proper divisors (2519758003093).
100200222002011 is an equidigital number, since it uses as much as digits as its factorization.
100200222002011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4307279181.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 100200222002011 its reverse (110200222002001), we get a palindrome (210400444004012).
The spelling of 100200222002011 in words is "one hundred trillion, two hundred billion, two hundred twenty-two million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •