Base | Representation |
---|---|
bin | 1001101100010001010000… |
… | …00101101011101111110110 |
3 | 2210110102202212000000011210 |
4 | 10312020220011223233312 |
5 | 10243140042334120202 |
6 | 113154422515542250 |
7 | 4326522445363113 |
oct | 466105005535766 |
9 | 83412685000153 |
10 | 21312300301302 |
11 | 687754aa0069a |
12 | 24825722ba986 |
13 | bb798381796a |
14 | 53974127590a |
15 | 26e5ada99c6c |
hex | 13622816bbf6 |
21312300301302 has 64 divisors (see below), whose sum is σ = 47509595642880. Its totient is φ = 6333999192576.
The previous prime is 21312300301297. The next prime is 21312300301307. The reversal of 21312300301302 is 20310300321312.
It is an interprime number because it is at equal distance from previous prime (21312300301297) and next prime (21312300301307).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21312300301307) 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 31 ways as a sum of consecutive naturals, for example, 41444403 + ... + 41955489.
It is an arithmetic number, because the mean of its divisors is an integer number (742337431920).
Almost surely, 221312300301302 is an apocalyptic number.
21312300301302 is an abundant number, since it is smaller than the sum of its proper divisors (26197295341578).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21312300301302 is a wasteful number, since it uses less digits than its factorization.
21312300301302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 532645.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 21312300301302 its reverse (20310300321312), we get a palindrome (41622600622614).
The spelling of 21312300301302 in words is "twenty-one trillion, three hundred twelve billion, three hundred million, three hundred one thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.263 sec. • engine limits •