Base | Representation |
---|---|
bin | 101111001011000010… |
… | …1101100011101000101 |
3 | 100200110221012012120101 |
4 | 1132112011230131011 |
5 | 3124431343314023 |
6 | 114312044204101 |
7 | 10214236352413 |
oct | 1362605543505 |
9 | 320427165511 |
10 | 101302323013 |
11 | 39a6457a711 |
12 | 17771b39631 |
13 | 972557bb88 |
14 | 4c8ddc82b3 |
15 | 297d7381ad |
hex | 179616c745 |
101302323013 has 2 divisors, whose sum is σ = 101302323014. Its totient is φ = 101302323012.
The previous prime is 101302322993. The next prime is 101302323029. The reversal of 101302323013 is 310323203101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100297623204 + 1004699809 = 316698^2 + 31697^2 .
It is an emirp because it is prime and its reverse (310323203101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101302323013 - 25 = 101302322981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101302321013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50651161506 + 50651161507.
It is an arithmetic number, because the mean of its divisors is an integer number (50651161507).
Almost surely, 2101302323013 is an apocalyptic number.
It is an amenable number.
101302323013 is a deficient number, since it is larger than the sum of its proper divisors (1).
101302323013 is an equidigital number, since it uses as much as digits as its factorization.
101302323013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 101302323013 its reverse (310323203101), we get a palindrome (411625526114).
The spelling of 101302323013 in words is "one hundred one billion, three hundred two million, three hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •