Base | Representation |
---|---|
bin | 10010101000001111… |
… | …11011111011100110 |
3 | 221211000012202001210 |
4 | 21110013323323212 |
5 | 130440313114342 |
6 | 4332230332250 |
7 | 502561441413 |
oct | 112407737346 |
9 | 27730182053 |
10 | 10001301222 |
11 | 4272523700 |
12 | 1b314ba086 |
13 | c35054823 |
14 | 6ac3c110a |
15 | 3d806879c |
hex | 2541fbee6 |
10001301222 has 24 divisors (see below), whose sum is σ = 21986333208. Its totient is φ = 3030697120.
The previous prime is 10001301217. The next prime is 10001301227. The reversal of 10001301222 is 22210310001.
It is an interprime number because it is at equal distance from previous prime (10001301217) and next prime (10001301227).
It is a super-2 number, since 2×100013012222 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10001301198 and 10001301207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10001301227) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6887223 + ... + 6888674.
It is an arithmetic number, because the mean of its divisors is an integer number (916097217).
Almost surely, 210001301222 is an apocalyptic number.
10001301222 is an abundant number, since it is smaller than the sum of its proper divisors (11985031986).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10001301222 is a wasteful number, since it uses less digits than its factorization.
10001301222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13775924 (or 13775913 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 10001301222 its reverse (22210310001), we get a palindrome (32211611223).
The spelling of 10001301222 in words is "ten billion, one million, three hundred one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.347 sec. • engine limits •