Base | Representation |
---|---|
bin | 1011000000011000110110… |
… | …1111111010010111000101 |
3 | 1120211212120110211010002211 |
4 | 2300012031233322113011 |
5 | 3041231431030120401 |
6 | 41423132210303421 |
7 | 2356201343330356 |
oct | 260061557722705 |
9 | 46755513733084 |
10 | 12101301020101 |
11 | 3946150a44627 |
12 | 1435391287b71 |
13 | 69a1bc9036b7 |
14 | 2db9c5747d2d |
15 | 15ebb149c951 |
hex | b018dbfa5c5 |
12101301020101 has 2 divisors, whose sum is σ = 12101301020102. Its totient is φ = 12101301020100.
The previous prime is 12101301020071. The next prime is 12101301020119. The reversal of 12101301020101 is 10102010310121.
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., 11785008384900 + 316292635201 = 3432930^2 + 562399^2 .
It is a cyclic number.
It is not a de Polignac number, because 12101301020101 - 233 = 12092711085509 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12101301020131) 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, 6050650510050 + 6050650510051.
It is an arithmetic number, because the mean of its divisors is an integer number (6050650510051).
Almost surely, 212101301020101 is an apocalyptic number.
It is an amenable number.
12101301020101 is a deficient number, since it is larger than the sum of its proper divisors (1).
12101301020101 is an equidigital number, since it uses as much as digits as its factorization.
12101301020101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 12101301020101 its reverse (10102010310121), we get a palindrome (22203311330222).
The spelling of 12101301020101 in words is "twelve trillion, one hundred one billion, three hundred one million, twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •