Base | Representation |
---|---|
bin | 11101000110101011001… |
… | …101110101010111000011 |
3 | 21002012102200200000210122 |
4 | 131012223031311113003 |
5 | 230232031233314021 |
6 | 4130445133450455 |
7 | 264332444150162 |
oct | 35065315652703 |
9 | 7065380600718 |
10 | 2000032323011 |
11 | 701233118618 |
12 | 283752940a2b |
13 | 1167aa170808 |
14 | 6cb32ca53d9 |
15 | 3705ac64bab |
hex | 1d1ab3755c3 |
2000032323011 has 8 divisors (see below), whose sum is σ = 2092405379904. Its totient is φ = 1909735065280.
The previous prime is 2000032322989. The next prime is 2000032323073. The reversal of 2000032323011 is 1103232300002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2000032323011 - 238 = 1725154416067 is a prime.
It is a super-2 number, since 2×20000323230112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2000032223011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 518947820 + ... + 518951673.
It is an arithmetic number, because the mean of its divisors is an integer number (261550672488).
Almost surely, 22000032323011 is an apocalyptic number.
2000032323011 is a deficient number, since it is larger than the sum of its proper divisors (92373056893).
2000032323011 is a wasteful number, since it uses less digits than its factorization.
2000032323011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1037899581.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 2000032323011 its reverse (1103232300002), we get a palindrome (3103264623013).
The spelling of 2000032323011 in words is "two trillion, thirty-two million, three hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •