Base | Representation |
---|---|
bin | 100101000111100101000… |
… | …0001011101011011010101 |
3 | 200001200220101112221001020 |
4 | 1022033022001131123111 |
5 | 1132040400440420121 |
6 | 14503334235151353 |
7 | 1034400211534632 |
oct | 112171201353325 |
9 | 20050811487036 |
10 | 5101515560661 |
11 | 16975a45a0833 |
12 | 6a485b2a5559 |
13 | 2b00bc883860 |
14 | 138cb3bdb189 |
15 | 8ca7ea2b1c6 |
hex | 4a3ca05d6d5 |
5101515560661 has 16 divisors (see below), whose sum is σ = 7334929843584. Its totient is φ = 3135247020864.
The previous prime is 5101515560651. The next prime is 5101515560681. The reversal of 5101515560661 is 1660655151015.
It is not a de Polignac number, because 5101515560661 - 25 = 5101515560629 is a prime.
It is a super-2 number, since 2×51015155606612 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5101515560641) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 86369481 + ... + 86428526.
It is an arithmetic number, because the mean of its divisors is an integer number (458433115224).
Almost surely, 25101515560661 is an apocalyptic number.
It is an amenable number.
5101515560661 is a deficient number, since it is larger than the sum of its proper divisors (2233414282923).
5101515560661 is a wasteful number, since it uses less digits than its factorization.
5101515560661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172798780.
The product of its (nonzero) digits is 135000, while the sum is 42.
The spelling of 5101515560661 in words is "five trillion, one hundred one billion, five hundred fifteen million, five hundred sixty thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •