Base | Representation |
---|---|
bin | 1001000110101010100010… |
… | …0001011010101011101101 |
3 | 1022102221211011021220222212 |
4 | 2101222220201122223231 |
5 | 2303001141342211023 |
6 | 33142324343220205 |
7 | 2052130431504623 |
oct | 221525041325355 |
9 | 38387734256885 |
10 | 10010101132013 |
11 | 320a295143004 |
12 | 1158036747665 |
13 | 577c43a94808 |
14 | 2686c4899513 |
15 | 1255bbb2ae78 |
hex | 91aa885aaed |
10010101132013 has 4 divisors (see below), whose sum is σ = 10010156423520. Its totient is φ = 10010045840508.
The previous prime is 10010101131973. The next prime is 10010101132063. The reversal of 10010101132013 is 31023110101001.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10010101132013 - 210 = 10010101130989 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 (10010101132063) 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, 27373295 + ... + 27736572.
It is an arithmetic number, because the mean of its divisors is an integer number (2502539105880).
Almost surely, 210010101132013 is an apocalyptic number.
It is an amenable number.
10010101132013 is a deficient number, since it is larger than the sum of its proper divisors (55291507).
10010101132013 is an equidigital number, since it uses as much as digits as its factorization.
10010101132013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55291506.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 10010101132013 its reverse (31023110101001), we get a palindrome (41033211233014).
The spelling of 10010101132013 in words is "ten trillion, ten billion, one hundred one million, one hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •