Base | Representation |
---|---|
bin | 10110111101111001000101… |
… | …001010010100110101011101 |
3 | 111020122110222121002201011112 |
4 | 112331321011022110311131 |
5 | 101214422343001431023 |
6 | 554455240144231405 |
7 | 30163513643525105 |
oct | 2675710512246535 |
9 | 436573877081145 |
10 | 101010201202013 |
11 | 2a204205280134 |
12 | b3b455400b565 |
13 | 44492b49b739c |
14 | 1ad2cc3dd4205 |
15 | ba27918d9478 |
hex | 5bde45294d5d |
101010201202013 has 2 divisors, whose sum is σ = 101010201202014. Its totient is φ = 101010201202012.
The previous prime is 101010201202003. The next prime is 101010201202019. The reversal of 101010201202013 is 310202102010101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83495331706084 + 17514869495929 = 9137578^2 + 4185077^2 .
It is a cyclic number.
It is not a de Polignac number, because 101010201202013 - 24 = 101010201201997 is a prime.
It is a super-2 number, since 2×1010102012020132 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101010201202019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50505100601006 + 50505100601007.
It is an arithmetic number, because the mean of its divisors is an integer number (50505100601007).
Almost surely, 2101010201202013 is an apocalyptic number.
It is an amenable number.
101010201202013 is a deficient number, since it is larger than the sum of its proper divisors (1).
101010201202013 is an equidigital number, since it uses as much as digits as its factorization.
101010201202013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 101010201202013 its reverse (310202102010101), we get a palindrome (411212303212114).
The spelling of 101010201202013 in words is "one hundred one trillion, ten billion, two hundred one million, two hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •