Base | Representation |
---|---|
bin | 101101011110100001111010… |
… | …111101100111001111100010 |
3 | 222020011210000202120211101000 |
4 | 231132201322331213033202 |
5 | 202203431141100341002 |
6 | 1545215212123452430 |
7 | 60062152506101610 |
oct | 5536417275471742 |
9 | 866153022524330 |
10 | 200010100012002 |
11 | 58802897227905 |
12 | 1a523369987116 |
13 | 877ab438c5447 |
14 | 375677d17c6b0 |
15 | 181cac5b0561c |
hex | b5e87af673e2 |
200010100012002 has 128 divisors (see below), whose sum is σ = 537868716871680. Its totient is φ = 53781585465600.
The previous prime is 200010100011983. The next prime is 200010100012043. The reversal of 200010100012002 is 200210001010002.
It is a super-2 number, since 2×2000101000120022 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 131794627 + ... + 133303577.
It is an arithmetic number, because the mean of its divisors is an integer number (4202099350560).
Almost surely, 2200010100012002 is an apocalyptic number.
200010100012002 is an abundant number, since it is smaller than the sum of its proper divisors (337858616859678).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200010100012002 is a wasteful number, since it uses less digits than its factorization.
200010100012002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1529613 (or 1529607 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 200010100012002 its reverse (200210001010002), we get a palindrome (400220101022004).
The spelling of 200010100012002 in words is "two hundred trillion, ten billion, one hundred million, twelve thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •