Base | Representation |
---|---|
bin | 111011110111111… |
… | …100001001011111 |
3 | 2121000011220102121 |
4 | 323313330021133 |
5 | 4024124120111 |
6 | 243402203411 |
7 | 33615164554 |
oct | 7367741137 |
9 | 2530156377 |
10 | 1004520031 |
11 | 476030849 |
12 | 2404b3567 |
13 | 130160668 |
14 | 975a6a2b |
15 | 5d2c5871 |
hex | 3bdfc25f |
1004520031 has 8 divisors (see below), whose sum is σ = 1017121824. Its totient is φ = 991994880.
The previous prime is 1004520029. The next prime is 1004520109. The reversal of 1004520031 is 1300254001.
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 1004520031 - 21 = 1004520029 is a prime.
It is a super-2 number, since 2×10045200312 = 2018120985360481922, 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 = 1004519987 and 1004520014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1004520631) 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, 7446 + ... + 45436.
It is an arithmetic number, because the mean of its divisors is an integer number (127140228).
Almost surely, 21004520031 is an apocalyptic number.
1004520031 is a deficient number, since it is larger than the sum of its proper divisors (12601793).
1004520031 is a wasteful number, since it uses less digits than its factorization.
1004520031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38321.
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 1004520031 is about 31694.1639896054. The cubic root of 1004520031 is about 1001.5044126077.
Adding to 1004520031 its reverse (1300254001), we get a palindrome (2304774032).
The spelling of 1004520031 in words is "one billion, four million, five hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •