Base | Representation |
---|---|
bin | 111000011100000110… |
… | …110110011101000101 |
3 | 12210102101122212001221 |
4 | 320130012312131011 |
5 | 1443102340200401 |
6 | 43501215520341 |
7 | 4243515565063 |
oct | 703406663505 |
9 | 183371585057 |
10 | 60601100101 |
11 | 23778817503 |
12 | b8b32290b1 |
13 | 593a14c719 |
14 | 2d0c645033 |
15 | 189a3db7a1 |
hex | e1c1b6745 |
60601100101 has 2 divisors, whose sum is σ = 60601100102. Its totient is φ = 60601100100.
The previous prime is 60601100069. The next prime is 60601100117. The reversal of 60601100101 is 10100110606.
60601100101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (60601100117) can be obtained adding 60601100101 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 58201080001 + 2400020100 = 241249^2 + 48990^2 .
It is a cyclic number.
It is not a de Polignac number, because 60601100101 - 25 = 60601100069 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (60601100401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30300550050 + 30300550051.
It is an arithmetic number, because the mean of its divisors is an integer number (30300550051).
Almost surely, 260601100101 is an apocalyptic number.
It is an amenable number.
60601100101 is a deficient number, since it is larger than the sum of its proper divisors (1).
60601100101 is an equidigital number, since it uses as much as digits as its factorization.
60601100101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 60601100101 its reverse (10100110606), we get a palindrome (70701210707).
The spelling of 60601100101 in words is "sixty billion, six hundred one million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •