Base | Representation |
---|---|
bin | 1001100011110110110000… |
… | …11011010111101100101001 |
3 | 2202102210120000122212012201 |
4 | 10301323120123113230221 |
5 | 10223421003424001413 |
6 | 112413531502340201 |
7 | 4266606343022005 |
oct | 461733033275451 |
9 | 82383500585181 |
10 | 21023201000233 |
11 | 6775986988893 |
12 | 243652b58a661 |
13 | b96630186083 |
14 | 529757b55705 |
15 | 266cdd3b29dd |
hex | 131ed86d7b29 |
21023201000233 has 2 divisors, whose sum is σ = 21023201000234. Its totient is φ = 21023201000232.
The previous prime is 21023201000201. The next prime is 21023201000251. The reversal of 21023201000233 is 33200010232012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10586088655129 + 10437112345104 = 3253627^2 + 3230652^2 .
It is a cyclic number.
It is not a de Polignac number, because 21023201000233 - 25 = 21023201000201 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21023201000233.
It is not a weakly prime, because it can be changed into another prime (21023201030233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10511600500116 + 10511600500117.
It is an arithmetic number, because the mean of its divisors is an integer number (10511600500117).
Almost surely, 221023201000233 is an apocalyptic number.
It is an amenable number.
21023201000233 is a deficient number, since it is larger than the sum of its proper divisors (1).
21023201000233 is an equidigital number, since it uses as much as digits as its factorization.
21023201000233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 21023201000233 its reverse (33200010232012), we get a palindrome (54223211232245).
The spelling of 21023201000233 in words is "twenty-one trillion, twenty-three billion, two hundred one million, two hundred thirty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •