Base | Representation |
---|---|
bin | 11101000111000111101… |
… | …111101110011001011001 |
3 | 21002020200001022210020220 |
4 | 131013013233232121121 |
5 | 230234021302010213 |
6 | 4131004432510253 |
7 | 264350345446614 |
oct | 35070757563131 |
9 | 7066601283226 |
10 | 2000510969433 |
11 | 70145931a779 |
12 | 2838670ab389 |
13 | 11685538a352 |
14 | 6cb7a69d17b |
15 | 37087cb0e23 |
hex | 1d1c7bee659 |
2000510969433 has 32 divisors (see below), whose sum is σ = 2941247376000. Its totient is φ = 1203805080576.
The previous prime is 2000510969407. The next prime is 2000510969441. The reversal of 2000510969433 is 3349690150002.
It is a happy number.
It is not a de Polignac number, because 2000510969433 - 29 = 2000510968921 is a prime.
It is a super-2 number, since 2×20005109694332 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2000510969453) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4318591 + ... + 4759332.
It is an arithmetic number, because the mean of its divisors is an integer number (91913980500).
Almost surely, 22000510969433 is an apocalyptic number.
It is an amenable number.
2000510969433 is a deficient number, since it is larger than the sum of its proper divisors (940736406567).
2000510969433 is a wasteful number, since it uses less digits than its factorization.
2000510969433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9078121.
The product of its (nonzero) digits is 174960, while the sum is 42.
The spelling of 2000510969433 in words is "two trillion, five hundred ten million, nine hundred sixty-nine thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •