Base | Representation |
---|---|
bin | 10110111111100000011110… |
… | …011001011100000110100011 |
3 | 111021001002112200120002200021 |
4 | 112333200132121130012203 |
5 | 101223232224310032321 |
6 | 555022240330334311 |
7 | 30204524046000403 |
oct | 2677403631340643 |
9 | 437032480502607 |
10 | 101121220002211 |
11 | 2a2472a5514982 |
12 | b411b77b8a397 |
13 | 44568c82a4736 |
14 | 1ad841661a803 |
15 | ba55dd178941 |
hex | 5bf81e65c1a3 |
101121220002211 has 8 divisors (see below), whose sum is σ = 104400770918400. Its totient is φ = 97842767590920.
The previous prime is 101121220002199. The next prime is 101121220002217. The reversal of 101121220002211 is 112200022121101.
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 101121220002211 - 225 = 101121186447779 is a prime.
It is a super-2 number, since 2×1011212200022112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101121220002217) 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, 274439131 + ... + 274807348.
It is an arithmetic number, because the mean of its divisors is an integer number (13050096364800).
Almost surely, 2101121220002211 is an apocalyptic number.
101121220002211 is a deficient number, since it is larger than the sum of its proper divisors (3279550916189).
101121220002211 is an equidigital number, since it uses as much as digits as its factorization.
101121220002211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 549252449.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 101121220002211 its reverse (112200022121101), we get a palindrome (213321242123312).
The spelling of 101121220002211 in words is "one hundred one trillion, one hundred twenty-one billion, two hundred twenty million, two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •