Base | Representation |
---|---|
bin | 101111000010001000… |
… | …0110010101000011101 |
3 | 100122201002102022120022 |
4 | 1132010100302220131 |
5 | 3123323312221023 |
6 | 114222242001525 |
7 | 10203645251222 |
oct | 1360420625035 |
9 | 318632368508 |
10 | 101003242013 |
11 | 39920773733 |
12 | 176a99462a5 |
13 | 96a861347b |
14 | 4c623b3949 |
15 | 296235b7c8 |
hex | 1784432a1d |
101003242013 has 2 divisors, whose sum is σ = 101003242014. Its totient is φ = 101003242012.
The previous prime is 101003242001. The next prime is 101003242049. The reversal of 101003242013 is 310242300101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 87732662809 + 13270579204 = 296197^2 + 115198^2 .
It is an emirp because it is prime and its reverse (310242300101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101003242013 - 220 = 101002193437 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 101003241982 and 101003242000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101003241013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50501621006 + 50501621007.
It is an arithmetic number, because the mean of its divisors is an integer number (50501621007).
Almost surely, 2101003242013 is an apocalyptic number.
It is an amenable number.
101003242013 is a deficient number, since it is larger than the sum of its proper divisors (1).
101003242013 is an equidigital number, since it uses as much as digits as its factorization.
101003242013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 101003242013 its reverse (310242300101), we get a palindrome (411245542114).
The spelling of 101003242013 in words is "one hundred one billion, three million, two hundred forty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •