Base | Representation |
---|---|
bin | 1010011101101011011101… |
… | …11101000101100110010001 |
3 | 10000110201211112222002011012 |
4 | 11032311232331011212101 |
5 | 11003443440313442040 |
6 | 120534352040300305 |
7 | 4563263166024311 |
oct | 516655675054621 |
9 | 100421745862135 |
10 | 23010001312145 |
11 | 7371539964641 |
12 | 26b75aaa71695 |
13 | cabaabb70403 |
14 | 597993539441 |
15 | 29d822646865 |
hex | 14ed6ef45991 |
23010001312145 has 8 divisors (see below), whose sum is σ = 27870057664704. Its totient is φ = 18235963656304.
The previous prime is 23010001312139. The next prime is 23010001312147. The reversal of 23010001312145 is 54121310001032.
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 23010001312145 - 222 = 23009997117841 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 23010001312145.
It is not an unprimeable number, because it can be changed into a prime (23010001312147) 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, 21504673589 + ... + 21504674658.
It is an arithmetic number, because the mean of its divisors is an integer number (3483757208088).
Almost surely, 223010001312145 is an apocalyptic number.
It is an amenable number.
23010001312145 is a deficient number, since it is larger than the sum of its proper divisors (4860056352559).
23010001312145 is a wasteful number, since it uses less digits than its factorization.
23010001312145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43009348359.
The product of its (nonzero) digits is 720, while the sum is 23.
Adding to 23010001312145 its reverse (54121310001032), we get a palindrome (77131311313177).
The spelling of 23010001312145 in words is "twenty-three trillion, ten billion, one million, three hundred twelve thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •