Base | Representation |
---|---|
bin | 100001101101010001000… |
… | …011000100010101110101 |
3 | 22012102220012210012001212 |
4 | 201231101003010111311 |
5 | 300422334331200003 |
6 | 4532040513531205 |
7 | 326231145516251 |
oct | 41552103042565 |
9 | 8172805705055 |
10 | 2316347131253 |
11 | 8133a2628811 |
12 | 314b0bb73b05 |
13 | 13a57a0396bc |
14 | 8017cac5261 |
15 | 403c08a0dd8 |
hex | 21b510c4575 |
2316347131253 has 4 divisors (see below), whose sum is σ = 2316359804928. Its totient is φ = 2316334457580.
The previous prime is 2316347131237. The next prime is 2316347131331. The reversal of 2316347131253 is 3521317436132.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2316347131253 - 24 = 2316347131237 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2316347131253.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2316347137253) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6058613 + ... + 6429578.
It is an arithmetic number, because the mean of its divisors is an integer number (579089951232).
Almost surely, 22316347131253 is an apocalyptic number.
It is an amenable number.
2316347131253 is a deficient number, since it is larger than the sum of its proper divisors (12673675).
2316347131253 is a wasteful number, since it uses less digits than its factorization.
2316347131253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12673674.
The product of its digits is 272160, while the sum is 41.
The spelling of 2316347131253 in words is "two trillion, three hundred sixteen billion, three hundred forty-seven million, one hundred thirty-one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •