Base | Representation |
---|---|
bin | 101101011111110111100111… |
… | …010000011110110111111010 |
3 | 222020111120112011220000212012 |
4 | 231133313213100132313322 |
5 | 202211433110432223002 |
6 | 1545325350231045522 |
7 | 60101620566302240 |
oct | 5537674720366772 |
9 | 866446464800765 |
10 | 200102111211002 |
11 | 58838913144530 |
12 | 1a5391682108a2 |
13 | 87867182b32b0 |
14 | 375adcb20c790 |
15 | 18201ad807d52 |
hex | b5fde741edfa |
200102111211002 has 32 divisors (see below), whose sum is σ = 403002853352064. Its totient is φ = 71964795240000.
The previous prime is 200102111210959. The next prime is 200102111211017. The reversal of 200102111211002 is 200112111201002.
It is a super-2 number, since 2×2001021112110022 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 49975550249 + ... + 49975554252.
It is an arithmetic number, because the mean of its divisors is an integer number (12593839167252).
Almost surely, 2200102111211002 is an apocalyptic number.
200102111211002 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
200102111211002 is an abundant number, since it is smaller than the sum of its proper divisors (202900742141062).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200102111211002 is a wasteful number, since it uses less digits than its factorization.
200102111211002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 99951104534.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 200102111211002 its reverse (200112111201002), we get a palindrome (400214222412004).
The spelling of 200102111211002 in words is "two hundred trillion, one hundred two billion, one hundred eleven million, two hundred eleven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •