Base | Representation |
---|---|
bin | 111100011101100… |
… | …001011010111101 |
3 | 2121200201102211102 |
4 | 330131201122331 |
5 | 4034134401104 |
6 | 244353302445 |
7 | 34065006566 |
oct | 7435413275 |
9 | 2550642742 |
10 | 1014372029 |
11 | 48064a7a0 |
12 | 243864a25 |
13 | 1321cca48 |
14 | 98a0d16d |
15 | 5e0bea1e |
hex | 3c7616bd |
1014372029 has 8 divisors (see below), whose sum is σ = 1107025920. Its totient is φ = 921791200.
The previous prime is 1014372017. The next prime is 1014372041. The reversal of 1014372029 is 9202734101.
It is an interprime number because it is at equal distance from previous prime (1014372017) and next prime (1014372041).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1014372029 - 212 = 1014367933 is a prime.
It is a super-2 number, since 2×10143720292 = 2057901226435153682, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1014371992 and 1014372010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1014372629) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13124 + ... + 46914.
It is an arithmetic number, because the mean of its divisors is an integer number (138378240).
Almost surely, 21014372029 is an apocalyptic number.
It is an amenable number.
1014372029 is a deficient number, since it is larger than the sum of its proper divisors (92653891).
1014372029 is a wasteful number, since it uses less digits than its factorization.
1014372029 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36531.
The product of its (nonzero) digits is 3024, while the sum is 29.
The square root of 1014372029 is about 31849.2076667537. The cubic root of 1014372029 is about 1004.7679072641.
The spelling of 1014372029 in words is "one billion, fourteen million, three hundred seventy-two thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •