Base | Representation |
---|---|
bin | 1110111010010100… |
… | …1101000000101111 |
3 | 101022221211202100102 |
4 | 3232211031000233 |
5 | 31144144330111 |
6 | 1501104221315 |
7 | 201122433566 |
oct | 35645150057 |
9 | 11287752312 |
10 | 4002730031 |
11 | 1774489353 |
12 | 93860a83b |
13 | 4ba369211 |
14 | 29d864bdd |
15 | 18661413b |
hex | ee94d02f |
4002730031 has 4 divisors (see below), whose sum is σ = 4006064064. Its totient is φ = 3999396000.
The previous prime is 4002729977. The next prime is 4002730049. The reversal of 4002730031 is 1300372004.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4002730031 - 210 = 4002729007 is a prime.
It is a super-2 number, since 2×40027300312 = 32043695402138521922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4002729985 and 4002730012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4002730331) 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 3 ways as a sum of consecutive naturals, for example, 1665215 + ... + 1667616.
It is an arithmetic number, because the mean of its divisors is an integer number (1001516016).
Almost surely, 24002730031 is an apocalyptic number.
4002730031 is a deficient number, since it is larger than the sum of its proper divisors (3334033).
4002730031 is a wasteful number, since it uses less digits than its factorization.
4002730031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3334032.
The product of its (nonzero) digits is 504, while the sum is 20.
The square root of 4002730031 is about 63267.1323121255. The cubic root of 4002730031 is about 1587.7621076797.
The spelling of 4002730031 in words is "four billion, two million, seven hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •