Base | Representation |
---|---|
bin | 1010100000010101100101… |
… | …01100011011101111110001 |
3 | 10000210110120112222100011212 |
4 | 11100022302230123233301 |
5 | 11011443012010012241 |
6 | 121044334440245505 |
7 | 4603005355013033 |
oct | 520126254335761 |
9 | 100713515870155 |
10 | 23101332110321 |
11 | 73a72467a9033 |
12 | 2711239470895 |
13 | cb75a55c1a1a |
14 | 59c179093c53 |
15 | 2a0dba748beb |
hex | 1502b2b1bbf1 |
23101332110321 has 64 divisors (see below), whose sum is σ = 24719449853952. Its totient is φ = 21544495644672.
The previous prime is 23101332110279. The next prime is 23101332110341. The reversal of 23101332110321 is 12301123310132.
It is a cyclic number.
It is not a de Polignac number, because 23101332110321 - 214 = 23101332093937 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is not an unprimeable number, because it can be changed into a prime (23101332110341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 31091967476 + ... + 31091968218.
It is an arithmetic number, because the mean of its divisors is an integer number (386241403968).
Almost surely, 223101332110321 is an apocalyptic number.
It is an amenable number.
23101332110321 is a deficient number, since it is larger than the sum of its proper divisors (1618117743631).
23101332110321 is a wasteful number, since it uses less digits than its factorization.
23101332110321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1662.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 23101332110321 its reverse (12301123310132), we get a palindrome (35402455420453).
The spelling of 23101332110321 in words is "twenty-three trillion, one hundred one billion, three hundred thirty-two million, one hundred ten thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •