Base | Representation |
---|---|
bin | 10110110000101010010101… |
… | …001101110010110111111011 |
3 | 111010102120012120202021100111 |
4 | 112300222111031302313323 |
5 | 101110023332333101021 |
6 | 552521434131445151 |
7 | 30041026242311002 |
oct | 2660522515626773 |
9 | 433376176667314 |
10 | 100101011222011 |
11 | 29993667230348 |
12 | b2882b61567b7 |
13 | 43b163c2c16b7 |
14 | 1aa0cb42a1c39 |
15 | b88ccc6a58e1 |
hex | 5b0a95372dfb |
100101011222011 has 4 divisors (see below), whose sum is σ = 100101627622000. Its totient is φ = 100100394822024.
The previous prime is 100101011221961. The next prime is 100101011222027. The reversal of 100101011222011 is 110222110101001.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100101011222011 - 215 = 100101011189243 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100101011221982 and 100101011222000.
It is not an unprimeable number, because it can be changed into a prime (100101011202011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 307956336 + ... + 308281213.
It is an arithmetic number, because the mean of its divisors is an integer number (25025406905500).
Almost surely, 2100101011222011 is an apocalyptic number.
100101011222011 is a deficient number, since it is larger than the sum of its proper divisors (616399989).
100101011222011 is an equidigital number, since it uses as much as digits as its factorization.
100101011222011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 616399988.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 100101011222011 its reverse (110222110101001), we get a palindrome (210323121323012).
The spelling of 100101011222011 in words is "one hundred trillion, one hundred one billion, eleven million, two hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •