Base | Representation |
---|---|
bin | 10011011000001000… |
… | …10011111001111111 |
3 | 222212000002100201121 |
4 | 21230010103321333 |
5 | 132301132112111 |
6 | 4440140251411 |
7 | 515540034550 |
oct | 115404237177 |
9 | 28760070647 |
10 | 10403004031 |
11 | 44592519a2 |
12 | 2023b40b67 |
13 | c9a3411b4 |
14 | 7098aa327 |
15 | 40d466871 |
hex | 26c113e7f |
10403004031 has 8 divisors (see below), whose sum is σ = 11968941600. Its totient is φ = 8857015008.
The previous prime is 10403004023. The next prime is 10403004037. The reversal of 10403004031 is 13040030401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10403004031 - 23 = 10403004023 is a prime.
It is a super-2 number, since 2×104030040312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10403003996 and 10403004014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10403004037) 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 7 ways as a sum of consecutive naturals, for example, 4986016 + ... + 4988101.
It is an arithmetic number, because the mean of its divisors is an integer number (1496117700).
Almost surely, 210403004031 is an apocalyptic number.
10403004031 is a deficient number, since it is larger than the sum of its proper divisors (1565937569).
10403004031 is an equidigital number, since it uses as much as digits as its factorization.
10403004031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9974273.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 10403004031 its reverse (13040030401), we get a palindrome (23443034432).
The spelling of 10403004031 in words is "ten billion, four hundred three million, four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •