Base | Representation |
---|---|
bin | 10110101111010111100010… |
… | …011011000000111101110110 |
3 | 111010010001202001121001120021 |
4 | 112233113202123000331312 |
5 | 101102044301212020042 |
6 | 552412532521355354 |
7 | 30031431242255122 |
oct | 2657274233007566 |
9 | 433101661531507 |
10 | 100012112220022 |
11 | 29959998046372 |
12 | b273026038b5a |
13 | 43a614260c442 |
14 | 1a9a87d6c2582 |
15 | b86827d0a867 |
hex | 5af5e26c0f76 |
100012112220022 has 4 divisors (see below), whose sum is σ = 150018168330036. Its totient is φ = 50006056110010.
The previous prime is 100012112220017. The next prime is 100012112220023. The reversal of 100012112220022 is 220022211210001.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×1000121122200222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100012112219978 and 100012112220005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100012112220023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25003028055004 + ... + 25003028055007.
It is an arithmetic number, because the mean of its divisors is an integer number (37504542082509).
Almost surely, 2100012112220022 is an apocalyptic number.
100012112220022 is a deficient number, since it is larger than the sum of its proper divisors (50006056110014).
100012112220022 is an equidigital number, since it uses as much as digits as its factorization.
100012112220022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50006056110013.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 100012112220022 its reverse (220022211210001), we get a palindrome (320034323430023).
The spelling of 100012112220022 in words is "one hundred trillion, twelve billion, one hundred twelve million, two hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •