Base | Representation |
---|---|
bin | 10011011000010001… |
… | …11100110001111111 |
3 | 222212002101010202122 |
4 | 21230020330301333 |
5 | 132301440020111 |
6 | 4440222313155 |
7 | 515553261002 |
oct | 115410746177 |
9 | 28762333678 |
10 | 10404220031 |
11 | 4459a02557 |
12 | 20244287bb |
13 | c9a67881a |
14 | 709b05539 |
15 | 40d606cdb |
hex | 26c23cc7f |
10404220031 has 16 divisors (see below), whose sum is σ = 11376857088. Its totient is φ = 9471945600.
The previous prime is 10404219989. The next prime is 10404220049. The reversal of 10404220031 is 13002240401.
It is a cyclic number.
It is not a de Polignac number, because 10404220031 - 26 = 10404219967 is a prime.
It is a super-2 number, since 2×104042200312 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10404219991 and 10404220009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10404220231) 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 15 ways as a sum of consecutive naturals, for example, 1847486 + ... + 1853108.
It is an arithmetic number, because the mean of its divisors is an integer number (711053568).
Almost surely, 210404220031 is an apocalyptic number.
10404220031 is a deficient number, since it is larger than the sum of its proper divisors (972637057).
10404220031 is a wasteful number, since it uses less digits than its factorization.
10404220031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9182.
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 10404220031 its reverse (13002240401), we get a palindrome (23406460432).
The spelling of 10404220031 in words is "ten billion, four hundred four million, two hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •