Base | Representation |
---|---|
bin | 11001001000000001… |
… | …01100000010010101 |
3 | 1021211002001100110021 |
4 | 30210000230002111 |
5 | 210111144441122 |
6 | 10110301225141 |
7 | 655162064323 |
oct | 144400540225 |
9 | 37732040407 |
10 | 13489062037 |
11 | 57a2250a60 |
12 | 27455621b1 |
13 | 136c7c7319 |
14 | 91d6b4d13 |
15 | 53e3591c7 |
hex | 32402c095 |
13489062037 has 8 divisors (see below), whose sum is σ = 14725294272. Its totient is φ = 12254488800.
The previous prime is 13489061939. The next prime is 13489062073. The reversal of 13489062037 is 73026098431.
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 13489062037 - 215 = 13489029269 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13489061984 and 13489062002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13489062077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 397713 + ... + 430294.
It is an arithmetic number, because the mean of its divisors is an integer number (1840661784).
Almost surely, 213489062037 is an apocalyptic number.
It is an amenable number.
13489062037 is a deficient number, since it is larger than the sum of its proper divisors (1236232235).
13489062037 is a wasteful number, since it uses less digits than its factorization.
13489062037 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 829499.
The product of its (nonzero) digits is 217728, while the sum is 43.
The spelling of 13489062037 in words is "thirteen billion, four hundred eighty-nine million, sixty-two thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •