Base | Representation |
---|---|
bin | 11101000110101111110… |
… | …110001100001001111010 |
3 | 21002012122002211222200122 |
4 | 131012233312030021322 |
5 | 230232211130323002 |
6 | 4130500550533242 |
7 | 264334406403605 |
oct | 35065766141172 |
9 | 7065562758618 |
10 | 2000110011002 |
11 | 701272a5a774 |
12 | 283774967222 |
13 | 1167c02a173c |
14 | 6cb3d32933c |
15 | 370629ad6a2 |
hex | 1d1afd8c27a |
2000110011002 has 64 divisors (see below), whose sum is σ = 3124724947200. Its totient is φ = 959675535360.
The previous prime is 2000110010893. The next prime is 2000110011019. The reversal of 2000110011002 is 2001100110002.
It is a super-2 number, since 2×20001100110022 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 423660002 + ... + 423664722.
It is an arithmetic number, because the mean of its divisors is an integer number (48823827300).
Almost surely, 22000110011002 is an apocalyptic number.
2000110011002 is a deficient number, since it is larger than the sum of its proper divisors (1124614936198).
2000110011002 is a wasteful number, since it uses less digits than its factorization.
2000110011002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5351.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 2000110011002 its reverse (2001100110002), we get a palindrome (4001210121004).
The spelling of 2000110011002 in words is "two trillion, one hundred ten million, eleven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •