Base | Representation |
---|---|
bin | 11101001101001101101… |
… | …000010101101001101001 |
3 | 21002212112220201001102000 |
4 | 131031031220111221221 |
5 | 230340420322203210 |
6 | 4134005501001213 |
7 | 265001423524212 |
oct | 35151550255151 |
9 | 7085486631360 |
10 | 2007052147305 |
11 | 7042056824a7 |
12 | 284b91853209 |
13 | 1173585c7bba |
14 | 6d1db302409 |
15 | 3731c197ac0 |
hex | 1d34da15a69 |
2007052147305 has 64 divisors (see below), whose sum is σ = 3712194969600. Its totient is φ = 1027740934080.
The previous prime is 2007052147301. The next prime is 2007052147363. The reversal of 2007052147305 is 5037412507002.
2007052147305 is a `hidden beast` number, since 20 + 0 + 70 + 521 + 47 + 3 + 0 + 5 = 666.
It is not a de Polignac number, because 2007052147305 - 22 = 2007052147301 is a prime.
It is a super-2 number, since 2×20070521473052 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2007052147305.
It is not an unprimeable number, because it can be changed into a prime (2007052147301) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1356625 + ... + 2419614.
It is an arithmetic number, because the mean of its divisors is an integer number (58003046400).
Almost surely, 22007052147305 is an apocalyptic number.
It is an amenable number.
2007052147305 is a deficient number, since it is larger than the sum of its proper divisors (1705142822295).
2007052147305 is a wasteful number, since it uses less digits than its factorization.
2007052147305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3776411 (or 3776405 counting only the distinct ones).
The product of its (nonzero) digits is 58800, while the sum is 36.
The spelling of 2007052147305 in words is "two trillion, seven billion, fifty-two million, one hundred forty-seven thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •