Base | Representation |
---|---|
bin | 11101011001010001011… |
… | …001101010111011001000 |
3 | 21011002222021222000121121 |
4 | 131121101121222323020 |
5 | 231043430040004112 |
6 | 4143550401045024 |
7 | 265640330234422 |
oct | 35312131527310 |
9 | 7132867860547 |
10 | 2020000313032 |
11 | 70974a574009 |
12 | 2875a6026774 |
13 | 11864001b620 |
14 | 6daa8c17812 |
15 | 37828cab407 |
hex | 1d65166aec8 |
2020000313032 has 64 divisors (see below), whose sum is σ = 4228732594800. Its totient is φ = 898188963840.
The previous prime is 2020000313017. The next prime is 2020000313053. The reversal of 2020000313032 is 2303130000202.
It can be written as a sum of positive squares in 8 ways, for example, as 529730686276 + 1490269626756 = 727826^2 + 1220766^2 .
It is a junction number, because it is equal to n+sod(n) for n = 2020000312997 and 2020000313015.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 645532 + ... + 2111092.
Almost surely, 22020000313032 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2020000313032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2114366297400).
2020000313032 is an abundant number, since it is smaller than the sum of its proper divisors (2208732281768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2020000313032 is a wasteful number, since it uses less digits than its factorization.
2020000313032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1466066 (or 1466062 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 16.
Adding to 2020000313032 its reverse (2303130000202), we get a palindrome (4323130313234).
The spelling of 2020000313032 in words is "two trillion, twenty billion, three hundred thirteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •