Base | Representation |
---|---|
bin | 1010100001001011100010… |
… | …11000011001111100111000 |
3 | 10000220020100110021002220102 |
4 | 11100211301120121330320 |
5 | 11012431324041041440 |
6 | 121105525202414532 |
7 | 4605052265324156 |
oct | 520456130317470 |
9 | 100806313232812 |
10 | 23130301112120 |
11 | 7408561a76934 |
12 | 2716983061448 |
13 | cba2411b54c7 |
14 | 59d7266023d6 |
15 | 2a1a13abbb15 |
hex | 150971619f38 |
23130301112120 has 16 divisors (see below), whose sum is σ = 52043177502360. Its totient is φ = 9252120444832.
The previous prime is 23130301112111. The next prime is 23130301112147. The reversal of 23130301112120 is 2121110303132.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 23130301112092 and 23130301112101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 289128763862 + ... + 289128763941.
Almost surely, 223130301112120 is an apocalyptic number.
23130301112120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23130301112120 is an abundant number, since it is smaller than the sum of its proper divisors (28912876390240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23130301112120 is a wasteful number, since it uses less digits than its factorization.
23130301112120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 578257527814 (or 578257527810 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 23130301112120 its reverse (2121110303132), we get a palindrome (25251411415252).
The spelling of 23130301112120 in words is "twenty-three trillion, one hundred thirty billion, three hundred one million, one hundred twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •