Base | Representation |
---|---|
bin | 1010011101101011111001… |
… | …01101011110110110111011 |
3 | 10000110202102122020102202212 |
4 | 11032311330231132312323 |
5 | 11003444423404233311 |
6 | 120534431003045335 |
7 | 4563302000511065 |
oct | 516657455366673 |
9 | 100422378212685 |
10 | 23010232102331 |
11 | 7371648167731 |
12 | 26b765421084b |
13 | cabb17918256 |
14 | 5979b6054735 |
15 | 29d837a33c8b |
hex | 14ed7cb5edbb |
23010232102331 has 32 divisors (see below), whose sum is σ = 24914415456000. Its totient is φ = 21172977745920.
The previous prime is 23010232102301. The next prime is 23010232102349. The reversal of 23010232102331 is 13320123201032.
It is a cyclic number.
It is not a de Polignac number, because 23010232102331 - 26 = 23010232102267 is a prime.
It is a super-2 number, since 2×230102321023312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23010232102297 and 23010232102306.
It is not an unprimeable number, because it can be changed into a prime (23010232102301) 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, 159122921 + ... + 159267461.
It is an arithmetic number, because the mean of its divisors is an integer number (778575483000).
Almost surely, 223010232102331 is an apocalyptic number.
23010232102331 is a deficient number, since it is larger than the sum of its proper divisors (1904183353669).
23010232102331 is a wasteful number, since it uses less digits than its factorization.
23010232102331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 145799.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 23010232102331 its reverse (13320123201032), we get a palindrome (36330355303363).
The spelling of 23010232102331 in words is "twenty-three trillion, ten billion, two hundred thirty-two million, one hundred two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •