Base | Representation |
---|---|
bin | 101010001110000001100… |
… | …101101001100001001100 |
3 | 101021100200222122001101200 |
4 | 222032001211221201030 |
5 | 340013303411230202 |
6 | 10100454524105500 |
7 | 416416231033125 |
oct | 52160145514114 |
9 | 11240628561350 |
10 | 2901277055052 |
11 | a19474296a82 |
12 | 3aa353995290 |
13 | 18078778374c |
14 | a05cb70304c |
15 | 507076b5e1c |
hex | 2a38196984c |
2901277055052 has 144 divisors (see below), whose sum is σ = 7418911500000. Its totient is φ = 955933655040.
The previous prime is 2901277054987. The next prime is 2901277055059. The reversal of 2901277055052 is 2505507721092.
2901277055052 is a `hidden beast` number, since 2 + 9 + 0 + 1 + 27 + 70 + 550 + 5 + 2 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 2901277054989 and 2901277055007.
It is not an unprimeable number, because it can be changed into a prime (2901277055059) 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 in 47 ways as a sum of consecutive naturals, for example, 2322879324 + ... + 2322880572.
It is an arithmetic number, because the mean of its divisors is an integer number (51520218750).
Almost surely, 22901277055052 is an apocalyptic number.
It is an amenable number.
2901277055052 is an abundant number, since it is smaller than the sum of its proper divisors (4517634444948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2901277055052 is a wasteful number, since it uses less digits than its factorization.
2901277055052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2936 (or 2931 counting only the distinct ones).
The product of its (nonzero) digits is 441000, while the sum is 45.
The spelling of 2901277055052 in words is "two trillion, nine hundred one billion, two hundred seventy-seven million, fifty-five thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •