Base | Representation |
---|---|
bin | 1010100110000111101100… |
… | …01000010111100000110101 |
3 | 10001111110110021212200110222 |
4 | 11103003312020113200311 |
5 | 11023221431143031401 |
6 | 121315515324424125 |
7 | 4623241341146051 |
oct | 523036610274065 |
9 | 101443407780428 |
10 | 23300032002101 |
11 | 74735406a8728 |
12 | 27438516a8045 |
13 | 100025046889a |
14 | 5a7a28626c61 |
15 | 2a61499aac1b |
hex | 1530f6217835 |
23300032002101 has 2 divisors, whose sum is σ = 23300032002102. Its totient is φ = 23300032002100.
The previous prime is 23300032002089. The next prime is 23300032002131. The reversal of 23300032002101 is 10120023000332.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20875751862001 + 2424280140100 = 4568999^2 + 1557010^2 .
It is a cyclic number.
It is not a de Polignac number, because 23300032002101 - 214 = 23300031985717 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 23300032002101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23300032002131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11650016001050 + 11650016001051.
It is an arithmetic number, because the mean of its divisors is an integer number (11650016001051).
Almost surely, 223300032002101 is an apocalyptic number.
It is an amenable number.
23300032002101 is a deficient number, since it is larger than the sum of its proper divisors (1).
23300032002101 is an equidigital number, since it uses as much as digits as its factorization.
23300032002101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 23300032002101 its reverse (10120023000332), we get a palindrome (33420055002433).
The spelling of 23300032002101 in words is "twenty-three trillion, three hundred billion, thirty-two million, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •