Base | Representation |
---|---|
bin | 11000010100000110… |
… | …00000100111001011 |
3 | 1020200201101121220010 |
4 | 30022003000213023 |
5 | 203213141303422 |
6 | 5555141003003 |
7 | 641322414255 |
oct | 141203004713 |
9 | 36621347803 |
10 | 13053462987 |
11 | 5599380a44 |
12 | 26436b3463 |
13 | 13004a03c6 |
14 | 8bb8c4cd5 |
15 | 515eb2b0c |
hex | 30a0c09cb |
13053462987 has 8 divisors (see below), whose sum is σ = 18161339904. Its totient is φ = 8323947368.
The previous prime is 13053462979. The next prime is 13053462997. The reversal of 13053462987 is 78926435031.
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 13053462987 - 23 = 13053462979 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13053462997) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 94590243 + ... + 94590380.
It is an arithmetic number, because the mean of its divisors is an integer number (2270167488).
It is a 1-persistent number, because it is pandigital, but 2⋅13053462987 = 26106925974 is not.
Almost surely, 213053462987 is an apocalyptic number.
13053462987 is a deficient number, since it is larger than the sum of its proper divisors (5107876917).
13053462987 is a wasteful number, since it uses less digits than its factorization.
13053462987 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 189180649.
The product of its (nonzero) digits is 1088640, while the sum is 48.
The spelling of 13053462987 in words is "thirteen billion, fifty-three million, four hundred sixty-two thousand, nine hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •