Base | Representation |
---|---|
bin | 10011000010100100… |
… | …01110010111111010 |
3 | 222101101200120210202 |
4 | 21201102032113322 |
5 | 131413324231020 |
6 | 4410155042202 |
7 | 511212301451 |
oct | 114122162772 |
9 | 28341616722 |
10 | 10222102010 |
11 | 437612359a |
12 | 1b93440362 |
13 | c6ba12893 |
14 | 6cd859b98 |
15 | 3ec630e75 |
hex | 26148e5fa |
10222102010 has 32 divisors (see below), whose sum is σ = 18533858832. Its totient is φ = 4059095040.
The previous prime is 10222101979. The next prime is 10222102019. The reversal of 10222102010 is 1020122201.
It is a happy number.
10222102010 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 7892012569 + 2330089441 = 88837^2 + 48271^2 .
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10222101982 and 10222102000.
It is not an unprimeable number, because it can be changed into a prime (10222102019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2278970 + ... + 2283450.
Almost surely, 210222102010 is an apocalyptic number.
10222102010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10222102010 is a deficient number, since it is larger than the sum of its proper divisors (8311756822).
10222102010 is a wasteful number, since it uses less digits than its factorization.
10222102010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6098.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 10222102010 its reverse (1020122201), we get a palindrome (11242224211).
The spelling of 10222102010 in words is "ten billion, two hundred twenty-two million, one hundred two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •