Base | Representation |
---|---|
bin | 110001011101011011… |
… | …1110110111000110110 |
3 | 101011011021011120220020 |
4 | 1202322313312320312 |
5 | 3220011342420042 |
6 | 120443315350010 |
7 | 10450043450064 |
oct | 1427267667066 |
9 | 334137146806 |
10 | 106214420022 |
11 | 410552a8917 |
12 | 18702bb2306 |
13 | a029141159 |
14 | 51d8527034 |
15 | 2b69ac93ec |
hex | 18badf6e36 |
106214420022 has 16 divisors (see below), whose sum is σ = 212432034240. Its totient is φ = 35404274312.
The previous prime is 106214419999. The next prime is 106214420023. The reversal of 106214420022 is 220024412601.
It is a happy number.
It is a super-2 number, since 2×1062144200222 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106214419974 and 106214420001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106214420023) 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, 710629 + ... + 847007.
It is an arithmetic number, because the mean of its divisors is an integer number (13277002140).
Almost surely, 2106214420022 is an apocalyptic number.
106214420022 is an abundant number, since it is smaller than the sum of its proper divisors (106217614218).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106214420022 is a wasteful number, since it uses less digits than its factorization.
106214420022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 266187.
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 106214420022 its reverse (220024412601), we get a palindrome (326238832623).
The spelling of 106214420022 in words is "one hundred six billion, two hundred fourteen million, four hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •