Base | Representation |
---|---|
bin | 111011110100000… |
… | …0111011111001011 |
3 | 12011212112102110101 |
4 | 1313220013133023 |
5 | 13102243131011 |
6 | 531053030231 |
7 | 100510155625 |
oct | 16750073713 |
9 | 5155472411 |
10 | 2007005131 |
11 | 93a9a172a |
12 | 480185377 |
13 | 25ca5aa01 |
14 | 15079dc15 |
15 | bb2e82c1 |
hex | 77a077cb |
2007005131 has 16 divisors (see below), whose sum is σ = 2187059200. Its totient is φ = 1839843720.
The previous prime is 2007005111. The next prime is 2007005149. The reversal of 2007005131 is 1315007002.
It is not a de Polignac number, because 2007005131 - 29 = 2007004619 is a prime.
It is a super-2 number, since 2×20070051312 = 8056139191720654322, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2007005099 and 2007005108.
It is not an unprimeable number, because it can be changed into a prime (2007005111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 207910 + ... + 217348.
It is an arithmetic number, because the mean of its divisors is an integer number (136691200).
Almost surely, 22007005131 is an apocalyptic number.
2007005131 is a deficient number, since it is larger than the sum of its proper divisors (180054069).
2007005131 is an frugal number, since it uses more digits than its factorization.
2007005131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9527 (or 9489 counting only the distinct ones).
The product of its (nonzero) digits is 210, while the sum is 19.
The square root of 2007005131 is about 44799.6108353633. The cubic root of 2007005131 is about 1261.3903211555.
The spelling of 2007005131 in words is "two billion, seven million, five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •