Base | Representation |
---|---|
bin | 1010100000101001101100… |
… | …10111011001011101000101 |
3 | 10000211111110011020000122220 |
4 | 11100110312113121131011 |
5 | 11012132121031414023 |
6 | 121053322204442553 |
7 | 4603540104060042 |
oct | 520246627313505 |
9 | 100744404200586 |
10 | 23112131123013 |
11 | 740088853a109 |
12 | 2713351b49459 |
13 | cb86069a786a |
14 | 59c8c13a61c9 |
15 | 2a12ed8363e3 |
hex | 1505365d9745 |
23112131123013 has 8 divisors (see below), whose sum is σ = 30816222132000. Its totient is φ = 15408063764688.
The previous prime is 23112131122961. The next prime is 23112131123033. The reversal of 23112131123013 is 31032113121132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 23112131123013 - 28 = 23112131122757 is a prime.
It is a super-6 number, since 6×231121311230136 (a number of 81 digits) contains 666666 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23112131123033) 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, 3490738 + ... + 7642611.
It is an arithmetic number, because the mean of its divisors is an integer number (3852027766500).
Almost surely, 223112131123013 is an apocalyptic number.
It is an amenable number.
23112131123013 is a deficient number, since it is larger than the sum of its proper divisors (7704091008987).
23112131123013 is a wasteful number, since it uses less digits than its factorization.
23112131123013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11825331.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 23112131123013 its reverse (31032113121132), we get a palindrome (54144244244145).
The spelling of 23112131123013 in words is "twenty-three trillion, one hundred twelve billion, one hundred thirty-one million, one hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •