Base | Representation |
---|---|
bin | 11001000111100111… |
… | …00011111011001001 |
3 | 1021210211120112011010 |
4 | 30203303203323021 |
5 | 210104304332222 |
6 | 10110055354133 |
7 | 655120613055 |
oct | 144363437311 |
9 | 37724515133 |
10 | 13485620937 |
11 | 57a0310678 |
12 | 2744382949 |
13 | 136bb90c79 |
14 | 91d05ac65 |
15 | 53ddc980c |
hex | 323ce3ec9 |
13485620937 has 16 divisors (see below), whose sum is σ = 19100840000. Its totient is φ = 8439090624.
The previous prime is 13485620921. The next prime is 13485620989. The reversal of 13485620937 is 73902658431.
It is not a de Polignac number, because 13485620937 - 24 = 13485620921 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13485620237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1079062 + ... + 1091487.
It is an arithmetic number, because the mean of its divisors is an integer number (1193802500).
It is a 1-persistent number, because it is pandigital, but 2⋅13485620937 = 26971241874 is not.
Almost surely, 213485620937 is an apocalyptic number.
It is an amenable number.
13485620937 is a deficient number, since it is larger than the sum of its proper divisors (5615219063).
13485620937 is a wasteful number, since it uses less digits than its factorization.
13485620937 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2170680.
The product of its (nonzero) digits is 1088640, while the sum is 48.
The spelling of 13485620937 in words is "thirteen billion, four hundred eighty-five million, six hundred twenty thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •