Base | Representation |
---|---|
bin | 1001001011111101111100… |
… | …0010001101001011001001 |
3 | 1022202122222200201111011212 |
4 | 2102333133002031023021 |
5 | 2310444234230312223 |
6 | 33252233134502505 |
7 | 2061534254262542 |
oct | 222773702151311 |
9 | 38678880644155 |
10 | 10101210010313 |
11 | 3244998792844 |
12 | 1171822964a35 |
13 | 5837035558a6 |
14 | 26cc88b674c9 |
15 | 127b504e4278 |
hex | 92fdf08d2c9 |
10101210010313 has 2 divisors, whose sum is σ = 10101210010314. Its totient is φ = 10101210010312.
The previous prime is 10101210010267. The next prime is 10101210010351. The reversal of 10101210010313 is 31301001210101.
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., 9909853632064 + 191356378249 = 3147992^2 + 437443^2 .
It is a cyclic number.
It is not a de Polignac number, because 10101210010313 - 220 = 10101208961737 is a prime.
It is not a weakly prime, because it can be changed into another prime (10101210010393) 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 as a sum of consecutive naturals, namely, 5050605005156 + 5050605005157.
It is an arithmetic number, because the mean of its divisors is an integer number (5050605005157).
Almost surely, 210101210010313 is an apocalyptic number.
It is an amenable number.
10101210010313 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101210010313 is an equidigital number, since it uses as much as digits as its factorization.
10101210010313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 10101210010313 its reverse (31301001210101), we get a palindrome (41402211220414).
The spelling of 10101210010313 in words is "ten trillion, one hundred one billion, two hundred ten million, ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •