Base | Representation |
---|---|
bin | 10110111101111001000000… |
… | …010101000001011011010110 |
3 | 111020122110202221112022120211 |
4 | 112331321000111001123112 |
5 | 101214422211222320042 |
6 | 554455224130320034 |
7 | 30163511640404341 |
oct | 2675710025013326 |
9 | 436573687468524 |
10 | 101010120120022 |
11 | 2a204173530023 |
12 | b3b4530a2901a |
13 | 44492a0c68689 |
14 | 1ad2cb7329458 |
15 | ba2789720017 |
hex | 5bde405416d6 |
101010120120022 has 16 divisors (see below), whose sum is σ = 164340711933552. Its totient is φ = 46374804071680.
The previous prime is 101010120120011. The next prime is 101010120120029. The reversal of 101010120120022 is 220021021010101.
It is a super-2 number, since 2×1010101201200222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101010120119984 and 101010120120011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101010120120029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36230314288 + ... + 36230317075.
It is an arithmetic number, because the mean of its divisors is an integer number (10271294495847).
Almost surely, 2101010120120022 is an apocalyptic number.
101010120120022 is a deficient number, since it is larger than the sum of its proper divisors (63330591813530).
101010120120022 is a wasteful number, since it uses less digits than its factorization.
101010120120022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72460631423.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101010120120022 its reverse (220021021010101), we get a palindrome (321031141130123).
The spelling of 101010120120022 in words is "one hundred one trillion, ten billion, one hundred twenty million, one hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •