Base | Representation |
---|---|
bin | 1010000000010110000000… |
… | …0001010011100011001010 |
3 | 1102221200120011002211010001 |
4 | 2200011200001103203022 |
5 | 2420220043140400020 |
6 | 35221444432513214 |
7 | 2213540404555303 |
oct | 240054001234312 |
9 | 42850504084101 |
10 | 11001022200010 |
11 | 3561564265a07 |
12 | 12980a40ab80a |
13 | 61a513134b2b |
14 | 2a06492217aa |
15 | 1412662c350a |
hex | a01600538ca |
11001022200010 has 32 divisors (see below), whose sum is σ = 20221721798400. Its totient is φ = 4307725934400.
The previous prime is 11001022199933. The next prime is 11001022200011. The reversal of 11001022200010 is 1000222010011.
It is a super-2 number, since 2×110010222000102 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a self number, because there is not a number n which added to its sum of digits gives 11001022200010.
It is not an unprimeable number, because it can be changed into a prime (11001022200011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 38866941 + ... + 39148960.
It is an arithmetic number, because the mean of its divisors is an integer number (631928806200).
Almost surely, 211001022200010 is an apocalyptic number.
11001022200010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11001022200010 is a deficient number, since it is larger than the sum of its proper divisors (9220699598390).
11001022200010 is a wasteful number, since it uses less digits than its factorization.
11001022200010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78016206.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 11001022200010 its reverse (1000222010011), we get a palindrome (12001244210021).
The spelling of 11001022200010 in words is "eleven trillion, one billion, twenty-two million, two hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •