Base | Representation |
---|---|
bin | 11101011100001010011… |
… | …010011111001101000011 |
3 | 21011101222121200111220012 |
4 | 131130022122133031003 |
5 | 231121304200442011 |
6 | 4145222402335135 |
7 | 266110260626450 |
oct | 35341232371503 |
9 | 7141877614805 |
10 | 2023104312131 |
11 | 70aaa2707521 |
12 | 28811165a4ab |
13 | 118a16116996 |
14 | 6dcc1172827 |
15 | 3795b544a8b |
hex | 1d70a69f343 |
2023104312131 has 8 divisors (see below), whose sum is σ = 2313447268704. Its totient is φ = 1733093369280.
The previous prime is 2023104312107. The next prime is 2023104312181. The reversal of 2023104312131 is 1312134013202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2023104312131 - 214 = 2023104295747 is a prime.
It is a super-2 number, since 2×20231043121312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2023104312097 and 2023104312106.
It is not an unprimeable number, because it can be changed into a prime (2023104312181) 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, 82990370 + ... + 83014743.
It is an arithmetic number, because the mean of its divisors is an integer number (289180908588).
Almost surely, 22023104312131 is an apocalyptic number.
2023104312131 is a deficient number, since it is larger than the sum of its proper divisors (290342956573).
2023104312131 is a wasteful number, since it uses less digits than its factorization.
2023104312131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 166006861.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 2023104312131 its reverse (1312134013202), we get a palindrome (3335238325333).
The spelling of 2023104312131 in words is "two trillion, twenty-three billion, one hundred four million, three hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.231 sec. • engine limits •