Base | Representation |
---|---|
bin | 10000000001011111111… |
… | …111110110000111001101 |
3 | 10220021012002200102202012 |
4 | 100001133333312013031 |
5 | 121020044240400023 |
6 | 2201503142111005 |
7 | 142360556161463 |
oct | 20013777660715 |
9 | 3807162612665 |
10 | 1101122200013 |
11 | 394a8a859520 |
12 | 1594a371b465 |
13 | 7cab242c854 |
14 | 3b41a544833 |
15 | 1d99926e978 |
hex | 1005fff61cd |
1101122200013 has 32 divisors (see below), whose sum is σ = 1213077600000. Its totient is φ = 991203333120.
The previous prime is 1101122200007. The next prime is 1101122200021. The reversal of 1101122200013 is 3100022211011.
It is not a de Polignac number, because 1101122200013 - 24 = 1101122199997 is a prime.
It is a super-2 number, since 2×11011222000132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101122200033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 517200533 + ... + 517202661.
It is an arithmetic number, because the mean of its divisors is an integer number (37908675000).
Almost surely, 21101122200013 is an apocalyptic number.
It is an amenable number.
1101122200013 is a deficient number, since it is larger than the sum of its proper divisors (111955399987).
1101122200013 is a wasteful number, since it uses less digits than its factorization.
1101122200013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3365.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 1101122200013 its reverse (3100022211011), we get a palindrome (4201144411024).
The spelling of 1101122200013 in words is "one trillion, one hundred one billion, one hundred twenty-two million, two hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •