Base | Representation |
---|---|
bin | 10011010111110001… |
… | …10110110011000110 |
3 | 222211210102210122110 |
4 | 21223320312303012 |
5 | 132244400014342 |
6 | 4435552041450 |
7 | 515502360162 |
oct | 115370666306 |
9 | 28753383573 |
10 | 10400001222 |
11 | 4457590936 |
12 | 2022b33286 |
13 | c9982c4a0 |
14 | 709327ca2 |
15 | 40d071c9c |
hex | 26be36cc6 |
10400001222 has 64 divisors (see below), whose sum is σ = 22677600960. Its totient is φ = 3160594944.
The previous prime is 10400001221. The next prime is 10400001229. The reversal of 10400001222 is 22210000401.
It is a junction number, because it is equal to n+sod(n) for n = 10400001198 and 10400001207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10400001221) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 2116104 + ... + 2121012.
It is an arithmetic number, because the mean of its divisors is an integer number (354337515).
Almost surely, 210400001222 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10400001222, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11338800480).
10400001222 is an abundant number, since it is smaller than the sum of its proper divisors (12277599738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10400001222 is a wasteful number, since it uses less digits than its factorization.
10400001222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5257.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 10400001222 its reverse (22210000401), we get a palindrome (32610001623).
The spelling of 10400001222 in words is "ten billion, four hundred million, one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •