Base | Representation |
---|---|
bin | 101111000010000110… |
… | …0001000010010101101 |
3 | 100122201000010020022001 |
4 | 1132010030020102231 |
5 | 3123323004120023 |
6 | 114222155452301 |
7 | 10203632001436 |
oct | 1360414102255 |
9 | 318630106261 |
10 | 101002020013 |
11 | 39920009614 |
12 | 176a9457091 |
13 | 96a82a61ab |
14 | 4c6217648d |
15 | 29621b96ad |
hex | 17843084ad |
101002020013 has 4 divisors (see below), whose sum is σ = 101007786460. Its totient is φ = 100996253568.
The previous prime is 101002020011. The next prime is 101002020017. The reversal of 101002020013 is 310020200101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 310020200101 = 356023 ⋅870787.
It can be written as a sum of positive squares in 2 ways, for example, as 29399217444 + 71602802569 = 171462^2 + 267587^2 .
It is a cyclic number.
It is not a de Polignac number, because 101002020013 - 21 = 101002020011 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101002020011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2856870 + ... + 2892007.
It is an arithmetic number, because the mean of its divisors is an integer number (25251946615).
Almost surely, 2101002020013 is an apocalyptic number.
It is an amenable number.
101002020013 is a deficient number, since it is larger than the sum of its proper divisors (5766447).
101002020013 is an equidigital number, since it uses as much as digits as its factorization.
101002020013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5766446.
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 101002020013 its reverse (310020200101), we get a palindrome (411022220114).
The spelling of 101002020013 in words is "one hundred one billion, two million, twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •