Base | Representation |
---|---|
bin | 11101000110101001111… |
… | …100100010000010011010 |
3 | 21002012101012120020010100 |
4 | 131012221330202002122 |
5 | 230232010304311302 |
6 | 4130443053000230 |
7 | 264332065042542 |
oct | 35065174420232 |
9 | 7065335506110 |
10 | 2000011010202 |
11 | 701222090a27 |
12 | 283747783076 |
13 | 1167a591a99a |
14 | 6cb30118322 |
15 | 37058e54d1c |
hex | 1d1a9f2209a |
2000011010202 has 12 divisors (see below), whose sum is σ = 4333357188810. Its totient is φ = 666670336728.
The previous prime is 2000011010197. The next prime is 2000011010209. The reversal of 2000011010202 is 2020101100002.
It can be written as a sum of positive squares in only one way, i.e., 1910142362241 + 89868647961 = 1382079^2 + 299781^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (2000011010209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 55555861377 + ... + 55555861412.
Almost surely, 22000011010202 is an apocalyptic number.
2000011010202 is an abundant number, since it is smaller than the sum of its proper divisors (2333346178608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000011010202 is a wasteful number, since it uses less digits than its factorization.
2000011010202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111111722797 (or 111111722794 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 2000011010202 its reverse (2020101100002), we get a palindrome (4020112110204).
The spelling of 2000011010202 in words is "two trillion, eleven million, ten thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •