Base | Representation |
---|---|
bin | 10110111111100000011101… |
… | …110111100011110111100010 |
3 | 111021001002112001211220010001 |
4 | 112333200131313203313202 |
5 | 101223232220021333442 |
6 | 555022235412130214 |
7 | 30204523610341123 |
oct | 2677403567436742 |
9 | 437032461756101 |
10 | 101121211121122 |
11 | 2a2472a04a9435 |
12 | b411b7500696a |
13 | 44568c64b525a |
14 | 1ad841538804a |
15 | ba55dc4c22b7 |
hex | 5bf81dde3de2 |
101121211121122 has 8 divisors (see below), whose sum is σ = 151718463666000. Its totient is φ = 50548389899124.
The previous prime is 101121211121101. The next prime is 101121211121171. The reversal of 101121211121122 is 221121112121101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 101121211121122.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6107820372 + ... + 6107836927.
It is an arithmetic number, because the mean of its divisors is an integer number (18964807958250).
Almost surely, 2101121211121122 is an apocalyptic number.
101121211121122 is a deficient number, since it is larger than the sum of its proper divisors (50597252544878).
101121211121122 is a wasteful number, since it uses less digits than its factorization.
101121211121122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12215661440.
The product of its (nonzero) digits is 32, while the sum is 19.
Adding to 101121211121122 its reverse (221121112121101), we get a palindrome (322242323242223).
The spelling of 101121211121122 in words is "one hundred one trillion, one hundred twenty-one billion, two hundred eleven million, one hundred twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •