Base | Representation |
---|---|
bin | 1100001000001101001010… |
… | …1111110111011111111101 |
3 | 1202012211021001002021211011 |
4 | 3002003102233313133331 |
5 | 3221440303222001422 |
6 | 44210022241555221 |
7 | 2544300363623323 |
oct | 302032257673775 |
9 | 52184231067734 |
10 | 13335114250237 |
11 | 4281432391a0a |
12 | 15b4526945b11 |
13 | 75965a5a0790 |
14 | 3415cc8d3d13 |
15 | 181d24943077 |
hex | c20d2bf77fd |
13335114250237 has 18 divisors (see below), whose sum is σ = 14455186303194. Its totient is φ = 12229036840800.
The previous prime is 13335114250163. The next prime is 13335114250373. The reversal of 13335114250237 is 73205241153331.
It can be written as a sum of positive squares in 3 ways, for example, as 3370847481 + 13331743402756 = 58059^2 + 3651266^2 .
It is not a de Polignac number, because 13335114250237 - 27 = 13335114250109 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13335114250237.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13335114251237) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 2067135862 + ... + 2067142312.
It is an arithmetic number, because the mean of its divisors is an integer number (803065905733).
Almost surely, 213335114250237 is an apocalyptic number.
It is an amenable number.
13335114250237 is a deficient number, since it is larger than the sum of its proper divisors (1120072052957).
13335114250237 is an frugal number, since it uses more digits than its factorization.
13335114250237 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13229 (or 6621 counting only the distinct ones).
The product of its (nonzero) digits is 226800, while the sum is 40.
The spelling of 13335114250237 in words is "thirteen trillion, three hundred thirty-five billion, one hundred fourteen million, two hundred fifty thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •