Base | Representation |
---|---|
bin | 10011000000101010… |
… | …10001000000100110 |
3 | 222100021121201101100 |
4 | 21200111101000212 |
5 | 131400231401042 |
6 | 4404424340530 |
7 | 510626414535 |
oct | 114025210046 |
9 | 28307551340 |
10 | 10206122022 |
11 | 43680a9598 |
12 | 1b8a014746 |
13 | c68609175 |
14 | 6cb69a31c |
15 | 3eb02624c |
hex | 260551026 |
10206122022 has 48 divisors (see below), whose sum is σ = 22507467840. Its totient is φ = 3341834496.
The previous prime is 10206122011. The next prime is 10206122027. The reversal of 10206122022 is 22022160201.
10206122022 is a `hidden beast` number, since 10 + 2 + 0 + 612 + 20 + 22 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 10206121986 and 10206122004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10206122027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 261918 + ... + 298350.
It is an arithmetic number, because the mean of its divisors is an integer number (468905580).
Almost surely, 210206122022 is an apocalyptic number.
10206122022 is an abundant number, since it is smaller than the sum of its proper divisors (12301345818).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10206122022 is a wasteful number, since it uses less digits than its factorization.
10206122022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36717 (or 36714 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 10206122022 its reverse (22022160201), we get a palindrome (32228282223).
The spelling of 10206122022 in words is "ten billion, two hundred six million, one hundred twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •