Base | Representation |
---|---|
bin | 1010011110010010111101… |
… | …01011001100001100110101 |
3 | 10000112202120010201111220022 |
4 | 11033021132223030030311 |
5 | 11004320400433142441 |
6 | 120552215534414525 |
7 | 4564643452416344 |
oct | 517113653141465 |
9 | 100482503644808 |
10 | 23031203021621 |
11 | 737a529757793 |
12 | 26bb727361445 |
13 | cb0aaa4ba632 |
14 | 598a05277b5b |
15 | 29e163b3984b |
hex | 14f25eacc335 |
23031203021621 has 2 divisors, whose sum is σ = 23031203021622. Its totient is φ = 23031203021620.
The previous prime is 23031203021551. The next prime is 23031203021633. The reversal of 23031203021621 is 12612030213032.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15147967577521 + 7883235444100 = 3892039^2 + 2807710^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23031203021621 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23031203021641) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11515601510810 + 11515601510811.
It is an arithmetic number, because the mean of its divisors is an integer number (11515601510811).
Almost surely, 223031203021621 is an apocalyptic number.
It is an amenable number.
23031203021621 is a deficient number, since it is larger than the sum of its proper divisors (1).
23031203021621 is an equidigital number, since it uses as much as digits as its factorization.
23031203021621 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 23031203021621 its reverse (12612030213032), we get a palindrome (35643233234653).
The spelling of 23031203021621 in words is "twenty-three trillion, thirty-one billion, two hundred three million, twenty-one thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •