Base | Representation |
---|---|
bin | 1011101001011110011… |
… | …1001010100010010010 |
3 | 201010112011021001222011 |
4 | 2322113213022202102 |
5 | 11234312200401002 |
6 | 231532533133134 |
7 | 20312651654212 |
oct | 2722747124222 |
9 | 633464231864 |
10 | 200112122002 |
11 | 7795a092111 |
12 | 3294918a1aa |
13 | 15b41618360 |
14 | 9984d4a242 |
15 | 53132208d7 |
hex | 2e979ca892 |
200112122002 has 16 divisors (see below), whose sum is σ = 333685723392. Its totient is φ = 89380103760.
The previous prime is 200112121967. The next prime is 200112122003. The reversal of 200112122002 is 200221211002.
It is a happy number.
200112122002 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2001121220022 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is not an unprimeable number, because it can be changed into a prime (200112122003) 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 7 ways as a sum of consecutive naturals, for example, 124138228 + ... + 124139839.
It is an arithmetic number, because the mean of its divisors is an integer number (20855357712).
Almost surely, 2200112122002 is an apocalyptic number.
200112122002 is a deficient number, since it is larger than the sum of its proper divisors (133573601390).
200112122002 is a wasteful number, since it uses less digits than its factorization.
200112122002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 248278113.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 200112122002 its reverse (200221211002), we get a palindrome (400333333004).
The spelling of 200112122002 in words is "two hundred billion, one hundred twelve million, one hundred twenty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •