Base | Representation |
---|---|
bin | 10010110100000010… |
… | …00101101110000001 |
3 | 222001220020202222121 |
4 | 21122001011232001 |
5 | 131141120411401 |
6 | 4350121404241 |
7 | 505202011414 |
oct | 113201055601 |
9 | 28056222877 |
10 | 10100169601 |
11 | 4313311a05 |
12 | 1b5a639681 |
13 | c4c690222 |
14 | 6bb599b7b |
15 | 3e1a97ca1 |
hex | 25a045b81 |
10100169601 has 2 divisors, whose sum is σ = 10100169602. Its totient is φ = 10100169600.
The previous prime is 10100169589. The next prime is 10100169661. The reversal of 10100169601 is 10696100101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7853504400 + 2246665201 = 88620^2 + 47399^2 .
It is an emirp because it is prime and its reverse (10696100101) is a distict prime. It is also a bemirp because it and its reverse can be mirrored producing other two distinct primes, 10969100101 and 10100196901.
It is a cyclic number.
It is not a de Polignac number, because 10100169601 - 215 = 10100136833 is a prime.
It is not a weakly prime, because it can be changed into another prime (10100169661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050084800 + 5050084801.
It is an arithmetic number, because the mean of its divisors is an integer number (5050084801).
Almost surely, 210100169601 is an apocalyptic number.
It is an amenable number.
10100169601 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100169601 is an equidigital number, since it uses as much as digits as its factorization.
10100169601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 25.
Adding to 10100169601 its reverse (10696100101), we get a palindrome (20796269702).
The spelling of 10100169601 in words is "ten billion, one hundred million, one hundred sixty-nine thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •