Base | Representation |
---|---|
bin | 111000111111111001… |
… | …010000001000000101 |
3 | 12211222020110002111021 |
4 | 320333321100020011 |
5 | 2000320041440023 |
6 | 44040544511141 |
7 | 4264426202632 |
oct | 707771201005 |
9 | 184866402437 |
10 | 61201515013 |
11 | 23a56729081 |
12 | ba4031b4b1 |
13 | 5a04662112 |
14 | 2d68299189 |
15 | 18d2e8c35d |
hex | e3fe50205 |
61201515013 has 2 divisors, whose sum is σ = 61201515014. Its totient is φ = 61201515012.
The previous prime is 61201515007. The next prime is 61201515017. The reversal of 61201515013 is 31051510216.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 58410189124 + 2791325889 = 241682^2 + 52833^2 .
It is a cyclic number.
It is not a de Polignac number, because 61201515013 - 233 = 52611580421 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (61201515017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30600757506 + 30600757507.
It is an arithmetic number, because the mean of its divisors is an integer number (30600757507).
Almost surely, 261201515013 is an apocalyptic number.
It is an amenable number.
61201515013 is a deficient number, since it is larger than the sum of its proper divisors (1).
61201515013 is an equidigital number, since it uses as much as digits as its factorization.
61201515013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 900, while the sum is 25.
The spelling of 61201515013 in words is "sixty-one billion, two hundred one million, five hundred fifteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •