Base | Representation |
---|---|
bin | 10011100101000101… |
… | …100110110010010101 |
3 | 2000021011002101002022 |
4 | 103211011212302111 |
5 | 321023432234422 |
6 | 13354042422525 |
7 | 1342656165512 |
oct | 234505466225 |
9 | 60234071068 |
10 | 21023321237 |
11 | 8a09131456 |
12 | 40a8801a45 |
13 | 1ca06bbb69 |
14 | 1036184309 |
15 | 830a07342 |
hex | 4e5166c95 |
21023321237 has 2 divisors, whose sum is σ = 21023321238. Its totient is φ = 21023321236.
The previous prime is 21023321203. The next prime is 21023321273. The reversal of 21023321237 is 73212332012.
It is a happy number.
Together with next prime (21023321273) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16587894436 + 4435426801 = 128794^2 + 66599^2 .
It is a cyclic number.
It is not a de Polignac number, because 21023321237 - 230 = 19949579413 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21023321537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10511660618 + 10511660619.
It is an arithmetic number, because the mean of its divisors is an integer number (10511660619).
Almost surely, 221023321237 is an apocalyptic number.
It is an amenable number.
21023321237 is a deficient number, since it is larger than the sum of its proper divisors (1).
21023321237 is an equidigital number, since it uses as much as digits as its factorization.
21023321237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 26.
Adding to 21023321237 its reverse (73212332012), we get a palindrome (94235653249).
The spelling of 21023321237 in words is "twenty-one billion, twenty-three million, three hundred twenty-one thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •