Base | Representation |
---|---|
bin | 10110111111100000011101… |
… | …111011101110001100110110 |
3 | 111021001002112010220022112202 |
4 | 112333200131323232030312 |
5 | 101223232220311241042 |
6 | 555022235451344502 |
7 | 30204523622533442 |
oct | 2677403573561466 |
9 | 437032463808482 |
10 | 101121212212022 |
11 | 2a2472a1084002 |
12 | b411b75452132 |
13 | 44568c67a7962 |
14 | 1ad841558d822 |
15 | ba55dc63a632 |
hex | 5bf81deee336 |
101121212212022 has 16 divisors (see below), whose sum is σ = 155279628675072. Its totient is φ = 49362401535720.
The previous prime is 101121212211997. The next prime is 101121212212039. The reversal of 101121212212022 is 220212212121101.
101121212212022 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 101121212211985 and 101121212212003.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 266196254 + ... + 266575857.
It is an arithmetic number, because the mean of its divisors is an integer number (9704976792192).
Almost surely, 2101121212212022 is an apocalyptic number.
101121212212022 is a deficient number, since it is larger than the sum of its proper divisors (54158416463050).
101121212212022 is a wasteful number, since it uses less digits than its factorization.
101121212212022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 532774363.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 101121212212022 its reverse (220212212121101), we get a palindrome (321333424333123).
The spelling of 101121212212022 in words is "one hundred one trillion, one hundred twenty-one billion, two hundred twelve million, two hundred twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •