Base | Representation |
---|---|
bin | 1001000110110110001001… |
… | …1011110001000100001001 |
3 | 1022110020212112101122201221 |
4 | 2101231202123301010021 |
5 | 2303024033333304001 |
6 | 33144002044042041 |
7 | 2052300634323325 |
oct | 221554233610411 |
9 | 38406775348657 |
10 | 10013220213001 |
11 | 3210645847795 |
12 | 1158767233321 |
13 | 578320040875 |
14 | 2688dcc1c985 |
15 | 1257008931a1 |
hex | 91b626f1109 |
10013220213001 has 2 divisors, whose sum is σ = 10013220213002. Its totient is φ = 10013220213000.
The previous prime is 10013220212999. The next prime is 10013220213043. The reversal of 10013220213001 is 10031202231001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9833868810000 + 179351403001 = 3135900^2 + 423499^2 .
It is a cyclic number.
It is not a de Polignac number, because 10013220213001 - 21 = 10013220212999 is a prime.
Together with 10013220212999, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (10013220213091) 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, 5006610106500 + 5006610106501.
It is an arithmetic number, because the mean of its divisors is an integer number (5006610106501).
Almost surely, 210013220213001 is an apocalyptic number.
It is an amenable number.
10013220213001 is a deficient number, since it is larger than the sum of its proper divisors (1).
10013220213001 is an equidigital number, since it uses as much as digits as its factorization.
10013220213001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 10013220213001 its reverse (10031202231001), we get a palindrome (20044422444002).
The spelling of 10013220213001 in words is "ten trillion, thirteen billion, two hundred twenty million, two hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •