Base | Representation |
---|---|
bin | 111011111001110… |
… | …0101110101101000 |
3 | 12012002012020112010 |
4 | 1313303211311220 |
5 | 13104030404112 |
6 | 531241315520 |
7 | 100544554206 |
oct | 16763456550 |
9 | 5162166463 |
10 | 2010013032 |
11 | 9416665a5 |
12 | 481195ba0 |
13 | 260571b31 |
14 | 150d44076 |
15 | bb6de63c |
hex | 77ce5d68 |
2010013032 has 32 divisors (see below), whose sum is σ = 5050296000. Its totient is φ = 666635904.
The previous prime is 2010013001. The next prime is 2010013039. The reversal of 2010013032 is 2303100102.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 2010012999 and 2010013017.
It is not an unprimeable number, because it can be changed into a prime (2010013039) 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 7 ways as a sum of consecutive naturals, for example, 205653 + ... + 215204.
It is an arithmetic number, because the mean of its divisors is an integer number (157821750).
Almost surely, 22010013032 is an apocalyptic number.
It is an amenable number.
2010013032 is an abundant number, since it is smaller than the sum of its proper divisors (3040282968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2010013032 is a wasteful number, since it uses less digits than its factorization.
2010013032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 421065 (or 421061 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
The square root of 2010013032 is about 44833.1688819784. The cubic root of 2010013032 is about 1262.0201556786.
Adding to 2010013032 its reverse (2303100102), we get a palindrome (4313113134).
The spelling of 2010013032 in words is "two billion, ten million, thirteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •