Base | Representation |
---|---|
bin | 100001101001010100101… |
… | …100010111000010111011 |
3 | 22012000222011010022001020 |
4 | 201221110230113002323 |
5 | 300340202002220443 |
6 | 4530100432353523 |
7 | 326021215644465 |
oct | 41512454270273 |
9 | 8160864108036 |
10 | 2312113320123 |
11 | 81161a768852 |
12 | 31412a0a58a3 |
13 | 13a053b53109 |
14 | 7dc9a6ab135 |
15 | 40223d43583 |
hex | 21a54b170bb |
2312113320123 has 8 divisors (see below), whose sum is σ = 3091550956368. Its totient is φ = 1537042281984.
The previous prime is 2312113320091. The next prime is 2312113320133. The reversal of 2312113320123 is 3210233112132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2312113320123 - 25 = 2312113320091 is a prime.
It is a super-4 number, since 4×23121133201234 (a number of 51 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2312113320093 and 2312113320102.
It is not an unprimeable number, because it can be changed into a prime (2312113320133) 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, 1091648290 + ... + 1091650407.
It is an arithmetic number, because the mean of its divisors is an integer number (386443869546).
Almost surely, 22312113320123 is an apocalyptic number.
2312113320123 is a deficient number, since it is larger than the sum of its proper divisors (779437636245).
2312113320123 is a wasteful number, since it uses less digits than its factorization.
2312113320123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2183299053.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 2312113320123 its reverse (3210233112132), we get a palindrome (5522346432255).
The spelling of 2312113320123 in words is "two trillion, three hundred twelve billion, one hundred thirteen million, three hundred twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •