Base | Representation |
---|---|
bin | 1010001011111110111110… |
… | …1000011111100010000100 |
3 | 1110122210201221211020002210 |
4 | 2202333233220133202010 |
5 | 2432004122012011322 |
6 | 35453400213303420 |
7 | 2234150140010463 |
oct | 242775750374204 |
9 | 43583657736083 |
10 | 11201000110212 |
11 | 3629354609780 |
12 | 130a9b4334b70 |
13 | 6333329bb603 |
14 | 2aa1ba3d29da |
15 | 14656c83270c |
hex | a2fefa1f884 |
11201000110212 has 24 divisors (see below), whose sum is σ = 28511636644512. Its totient is φ = 3394242457600.
The previous prime is 11201000110189. The next prime is 11201000110249. The reversal of 11201000110212 is 21201100010211.
It is a super-2 number, since 2×112010001102122 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42428030589 + ... + 42428030852.
It is an arithmetic number, because the mean of its divisors is an integer number (1187984860188).
Almost surely, 211201000110212 is an apocalyptic number.
11201000110212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11201000110212 is an abundant number, since it is smaller than the sum of its proper divisors (17310636534300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11201000110212 is a wasteful number, since it uses less digits than its factorization.
11201000110212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 84856061459 (or 84856061457 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11201000110212 its reverse (21201100010211), we get a palindrome (32402100120423).
The spelling of 11201000110212 in words is "eleven trillion, two hundred one billion, one hundred ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •