Base | Representation |
---|---|
bin | 11101010001000100111… |
… | …011011000010010111000 |
3 | 21010021021001201020221100 |
4 | 131101010323120102320 |
5 | 230422414441024344 |
6 | 4135533311411400 |
7 | 265206303244014 |
oct | 35210473302270 |
9 | 7107231636840 |
10 | 2011201111224 |
11 | 705a446604a8 |
12 | 28594b223b60 |
13 | 11786a044a36 |
14 | 6d4b2351544 |
15 | 374b1545569 |
hex | 1d444ed84b8 |
2011201111224 has 96 divisors (see below), whose sum is σ = 5635787086800. Its totient is φ = 647173255680.
The previous prime is 2011201111151. The next prime is 2011201111261. The reversal of 2011201111224 is 4221111021102.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 2011201111197 and 2011201111206.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12701967 + ... + 12859329.
Almost surely, 22011201111224 is an apocalyptic number.
2011201111224 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
2011201111224 is an abundant number, since it is smaller than the sum of its proper divisors (3624585975576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2011201111224 is a wasteful number, since it uses less digits than its factorization.
2011201111224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163525 (or 163518 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 2011201111224 its reverse (4221111021102), we get a palindrome (6232312132326).
The spelling of 2011201111224 in words is "two trillion, eleven billion, two hundred one million, one hundred eleven thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •