Base | Representation |
---|---|
bin | 100001101001100000011… |
… | …011110100010011110111 |
3 | 22012001110212210102112121 |
4 | 201221200123310103313 |
5 | 300341102414411020 |
6 | 4530132150500411 |
7 | 326026130224420 |
oct | 41514033642367 |
9 | 8161425712477 |
10 | 2312310310135 |
11 | 811710985311 |
12 | 314184064707 |
13 | 13a0858c5357 |
14 | 7dcb8908647 |
15 | 402362a5baa |
hex | 21a606f44f7 |
2312310310135 has 16 divisors (see below), whose sum is σ = 3238640096256. Its totient is φ = 1551848377248.
The previous prime is 2312310310117. The next prime is 2312310310153. The reversal of 2312310310135 is 5310130132132.
2312310310135 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (2312310310117) and next prime (2312310310153).
It is a cyclic number.
It is not a de Polignac number, because 2312310310135 - 231 = 2310162826487 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 702828237 + ... + 702831526.
It is an arithmetic number, because the mean of its divisors is an integer number (202415006016).
Almost surely, 22312310310135 is an apocalyptic number.
2312310310135 is a deficient number, since it is larger than the sum of its proper divisors (926329786121).
2312310310135 is a wasteful number, since it uses less digits than its factorization.
2312310310135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1405659822.
The product of its (nonzero) digits is 1620, while the sum is 25.
Adding to 2312310310135 its reverse (5310130132132), we get a palindrome (7622440442267).
The spelling of 2312310310135 in words is "two trillion, three hundred twelve billion, three hundred ten million, three hundred ten thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •