Base | Representation |
---|---|
bin | 1010100000111000011010… |
… | …01111000010101101000101 |
3 | 10000212020211201020102112210 |
4 | 11100130031033002231011 |
5 | 11012244310414021123 |
6 | 121101110130334033 |
7 | 4604236630660353 |
oct | 520341517025505 |
9 | 100766751212483 |
10 | 23120031001413 |
11 | 7404171842735 |
12 | 271499772a319 |
13 | cb9295563a18 |
14 | 59d03064a7d3 |
15 | 2a1612155e93 |
hex | 15070d3c2b45 |
23120031001413 has 8 divisors (see below), whose sum is σ = 30835433379168. Its totient is φ = 15408991312304.
The previous prime is 23120031001411. The next prime is 23120031001433. The reversal of 23120031001413 is 31410013002132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 23120031001413 - 21 = 23120031001411 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 23120031001413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23120031001411) 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, 1090659795 + ... + 1090680992.
It is an arithmetic number, because the mean of its divisors is an integer number (3854429172396).
Almost surely, 223120031001413 is an apocalyptic number.
It is an amenable number.
23120031001413 is a deficient number, since it is larger than the sum of its proper divisors (7715402377755).
23120031001413 is a wasteful number, since it uses less digits than its factorization.
23120031001413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2181344323.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 23120031001413 its reverse (31410013002132), we get a palindrome (54530044003545).
The spelling of 23120031001413 in words is "twenty-three trillion, one hundred twenty billion, thirty-one million, one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •