Base | Representation |
---|---|
bin | 100001101100001101100… |
… | …001110110111010110101 |
3 | 22012022222021021001010200 |
4 | 201230031201312322311 |
5 | 300413024333231203 |
6 | 4531332250311113 |
7 | 326161112201061 |
oct | 41541541667265 |
9 | 8168867231120 |
10 | 2315214352053 |
11 | 812971164a59 |
12 | 314854728499 |
13 | 13a42944ca55 |
14 | 800b2492aa1 |
15 | 403561e29a3 |
hex | 21b0d876eb5 |
2315214352053 has 96 divisors (see below), whose sum is σ = 3573536279040. Its totient is φ = 1441786106880.
The previous prime is 2315214351973. The next prime is 2315214352141. The reversal of 2315214352053 is 3502534125132.
2315214352053 is a `hidden beast` number, since 2 + 3 + 15 + 2 + 1 + 435 + 205 + 3 = 666.
It is not a de Polignac number, because 2315214352053 - 28 = 2315214351797 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2315214351999 and 2315214352017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2315214351053) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 971553300 + ... + 971555682.
It is an arithmetic number, because the mean of its divisors is an integer number (37224336240).
Almost surely, 22315214352053 is an apocalyptic number.
It is an amenable number.
2315214352053 is a deficient number, since it is larger than the sum of its proper divisors (1258321926987).
2315214352053 is a wasteful number, since it uses less digits than its factorization.
2315214352053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3179 (or 3176 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 36.
Adding to 2315214352053 its reverse (3502534125132), we get a palindrome (5817748477185).
The spelling of 2315214352053 in words is "two trillion, three hundred fifteen billion, two hundred fourteen million, three hundred fifty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •