Base | Representation |
---|---|
bin | 111011111010110… |
… | …0100010010111000 |
3 | 12012010011120001010 |
4 | 1313311210102320 |
5 | 13104143443000 |
6 | 531300353520 |
7 | 100552142262 |
oct | 16765442270 |
9 | 5163146033 |
10 | 2010531000 |
11 | 94198a775 |
12 | 4813a58a0 |
13 | 2606c381a |
14 | 15103ab32 |
15 | bb792d50 |
hex | 77d644b8 |
2010531000 has 64 divisors (see below), whose sum is σ = 6272866080. Its totient is φ = 536140800.
The previous prime is 2010530971. The next prime is 2010531001. The reversal of 2010531000 is 1350102.
It is a super-2 number, since 2×20105310002 = 8084469803922000000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2010531001) 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 15 ways as a sum of consecutive naturals, for example, 332089 + ... + 338088.
Almost surely, 22010531000 is an apocalyptic number.
2010531000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2010531000 is an abundant number, since it is smaller than the sum of its proper divisors (4262335080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2010531000 is a wasteful number, since it uses less digits than its factorization.
2010531000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 670201 (or 670187 counting only the distinct ones).
The product of its (nonzero) digits is 30, while the sum is 12.
The square root of 2010531000 is about 44838.9451258613. The cubic root of 2010531000 is about 1262.1285513131.
Adding to 2010531000 its reverse (1350102), we get a palindrome (2011881102).
The spelling of 2010531000 in words is "two billion, ten million, five hundred thirty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •