Base | Representation |
---|---|
bin | 1001101001111000100010… |
… | …00110010011101011111101 |
3 | 2210011121010211011211112201 |
4 | 10310330101012103223331 |
5 | 10240314133403212201 |
6 | 113053023031431501 |
7 | 4320560610166663 |
oct | 464742106235375 |
9 | 83147124154481 |
10 | 21230310210301 |
11 | 68457a6705805 |
12 | 246a6abb25591 |
13 | bb00182c7b0a |
14 | 5357a40a0c33 |
15 | 26c3b0a24801 |
hex | 134f11193afd |
21230310210301 has 2 divisors, whose sum is σ = 21230310210302. Its totient is φ = 21230310210300.
The previous prime is 21230310210293. The next prime is 21230310210311. The reversal of 21230310210301 is 10301201303212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20567268063225 + 663042147076 = 4535115^2 + 814274^2 .
It is a cyclic number.
It is not a de Polignac number, because 21230310210301 - 23 = 21230310210293 is a prime.
It is a super-2 number, since 2×212303102103012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21230310210311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10615155105150 + 10615155105151.
It is an arithmetic number, because the mean of its divisors is an integer number (10615155105151).
Almost surely, 221230310210301 is an apocalyptic number.
It is an amenable number.
21230310210301 is a deficient number, since it is larger than the sum of its proper divisors (1).
21230310210301 is an equidigital number, since it uses as much as digits as its factorization.
21230310210301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 21230310210301 its reverse (10301201303212), we get a palindrome (31531511513513).
The spelling of 21230310210301 in words is "twenty-one trillion, two hundred thirty billion, three hundred ten million, two hundred ten thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •