Base | Representation |
---|---|
bin | 11000101001111111… |
… | …10110101000011101 |
3 | 1021011112002200012002 |
4 | 30110333312220131 |
5 | 204102204410203 |
6 | 10025302452045 |
7 | 646013134151 |
oct | 142477665035 |
9 | 37145080162 |
10 | 13237185053 |
11 | 5683056064 |
12 | 2695134025 |
13 | 132c5784a1 |
14 | 8d806b061 |
15 | 5271a3d88 |
hex | 314ff6a1d |
13237185053 has 8 divisors (see below), whose sum is σ = 13732887000. Its totient is φ = 12744099648.
The previous prime is 13237185037. The next prime is 13237185061. The reversal of 13237185053 is 35058173231.
It can be written as a sum of positive squares in 4 ways, for example, as 7942730884 + 5294454169 = 89122^2 + 72763^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13237185053 - 24 = 13237185037 is a prime.
It is a super-2 number, since 2×132371850532 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13237184998 and 13237185016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13237185023) 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, 643826 + ... + 664067.
It is an arithmetic number, because the mean of its divisors is an integer number (1716610875).
Almost surely, 213237185053 is an apocalyptic number.
It is an amenable number.
13237185053 is a deficient number, since it is larger than the sum of its proper divisors (495701947).
13237185053 is a wasteful number, since it uses less digits than its factorization.
13237185053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1308271.
The product of its (nonzero) digits is 75600, while the sum is 38.
The spelling of 13237185053 in words is "thirteen billion, two hundred thirty-seven million, one hundred eighty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •