Base | Representation |
---|---|
bin | 110001010111101001… |
… | …0101110000100110110 |
3 | 101010122201120220020220 |
4 | 1202233102232010312 |
5 | 3214112123311342 |
6 | 120412135235210 |
7 | 10442164165101 |
oct | 1425722560466 |
9 | 333581526226 |
10 | 106020135222 |
11 | 40a65669871 |
12 | 18669b18b06 |
13 | 9cc7b08331 |
14 | 51ba7d1738 |
15 | 2b579ed5ec |
hex | 18af4ae136 |
106020135222 has 32 divisors (see below), whose sum is σ = 220026322944. Its totient is φ = 34020974400.
The previous prime is 106020135131. The next prime is 106020135259. The reversal of 106020135222 is 222531020601.
It is a super-2 number, since 2×1060201352222 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106020135192 and 106020135201.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1456623 + ... + 1527674.
It is an arithmetic number, because the mean of its divisors is an integer number (6875822592).
Almost surely, 2106020135222 is an apocalyptic number.
106020135222 is an abundant number, since it is smaller than the sum of its proper divisors (114006187722).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106020135222 is a wasteful number, since it uses less digits than its factorization.
106020135222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2984524.
The product of its (nonzero) digits is 1440, while the sum is 24.
Adding to 106020135222 its reverse (222531020601), we get a palindrome (328551155823).
The spelling of 106020135222 in words is "one hundred six billion, twenty million, one hundred thirty-five thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •