Base | Representation |
---|---|
bin | 1010100001100001010101… |
… | …10100001110100101001111 |
3 | 10000221100112220210011012211 |
4 | 11100300222310032211033 |
5 | 11013124310021001020 |
6 | 121115142232011251 |
7 | 4605645246310555 |
oct | 520605264164517 |
9 | 100840486704184 |
10 | 23142002125135 |
11 | 7412516986123 |
12 | 27190a9830b27 |
13 | cbb38741534a |
14 | 5a0116631bd5 |
15 | 2a1e9ae7d85a |
hex | 150c2ad0e94f |
23142002125135 has 32 divisors (see below), whose sum is σ = 30417466540032. Its totient is φ = 16826374525440.
The previous prime is 23142002125111. The next prime is 23142002125139. The reversal of 23142002125135 is 53152120024132.
It is a happy number.
It is not a de Polignac number, because 23142002125135 - 27 = 23142002125007 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23142002125097 and 23142002125106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23142002125139) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8172607 + ... + 10633696.
It is an arithmetic number, because the mean of its divisors is an integer number (950545829376).
Almost surely, 223142002125135 is an apocalyptic number.
23142002125135 is a deficient number, since it is larger than the sum of its proper divisors (7275464414897).
23142002125135 is a wasteful number, since it uses less digits than its factorization.
23142002125135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18806823.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 23142002125135 its reverse (53152120024132), we get a palindrome (76294122149267).
The spelling of 23142002125135 in words is "twenty-three trillion, one hundred forty-two billion, two million, one hundred twenty-five thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •