Base | Representation |
---|---|
bin | 10011011000010001… |
… | …00010111110010111 |
3 | 222212002011202202200 |
4 | 21230020202332113 |
5 | 132301423124302 |
6 | 4440220135543 |
7 | 515552340555 |
oct | 115410427627 |
9 | 28762152680 |
10 | 10404114327 |
11 | 44599400a2 |
12 | 20243975b3 |
13 | c9a63c689 |
14 | 709ab8bd5 |
15 | 40d5d581c |
hex | 26c222f97 |
10404114327 has 24 divisors (see below), whose sum is σ = 15551318640. Its totient is φ = 6694773120.
The previous prime is 10404114319. The next prime is 10404114337. The reversal of 10404114327 is 72341140401.
10404114327 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10404114327 - 23 = 10404114319 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10404114327.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10404114317) 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 23 ways as a sum of consecutive naturals, for example, 1517427 + ... + 1524267.
It is an arithmetic number, because the mean of its divisors is an integer number (647971610).
Almost surely, 210404114327 is an apocalyptic number.
10404114327 is a deficient number, since it is larger than the sum of its proper divisors (5147204313).
10404114327 is a wasteful number, since it uses less digits than its factorization.
10404114327 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12703 (or 12700 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 27.
Adding to 10404114327 its reverse (72341140401), we get a palindrome (82745254728).
The spelling of 10404114327 in words is "ten billion, four hundred four million, one hundred fourteen thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •