Base | Representation |
---|---|
bin | 1001000110101101111000… |
… | …1011010111001010100101 |
3 | 1022110001010220011012220102 |
4 | 2101223132023113022211 |
5 | 2303010012314220401 |
6 | 33142553541313445 |
7 | 2052161642125655 |
oct | 221533613271245 |
9 | 38401126135812 |
10 | 10011001320101 |
11 | 320a707293701 |
12 | 1158248105885 |
13 | 5780584259a2 |
14 | 26876c264365 |
15 | 125620b9356b |
hex | 91ade2d72a5 |
10011001320101 has 2 divisors, whose sum is σ = 10011001320102. Its totient is φ = 10011001320100.
The previous prime is 10011001320083. The next prime is 10011001320191. The reversal of 10011001320101 is 10102310011001.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9505197302500 + 505804017601 = 3083050^2 + 711199^2 .
It is a cyclic number.
It is not a de Polignac number, because 10011001320101 - 226 = 10010934211237 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10011001320191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005500660050 + 5005500660051.
It is an arithmetic number, because the mean of its divisors is an integer number (5005500660051).
Almost surely, 210011001320101 is an apocalyptic number.
It is an amenable number.
10011001320101 is a deficient number, since it is larger than the sum of its proper divisors (1).
10011001320101 is an equidigital number, since it uses as much as digits as its factorization.
10011001320101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 10011001320101 its reverse (10102310011001), we get a palindrome (20113311331102).
The spelling of 10011001320101 in words is "ten trillion, eleven billion, one million, three hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •