Base | Representation |
---|---|
bin | 1010000110110000100001… |
… | …1000011010011000101010 |
3 | 1110100020000002121111021112 |
4 | 2201230020120122120222 |
5 | 2424021240034341020 |
6 | 35344231403510322 |
7 | 2224521262164500 |
oct | 241541030323052 |
9 | 43306002544245 |
10 | 11111221012010 |
11 | 35a4273657459 |
12 | 12b55195283a2 |
13 | 627a25891372 |
14 | 2a5b00998670 |
15 | 144065a8d2c5 |
hex | a1b0861a62a |
11111221012010 has 48 divisors (see below), whose sum is σ = 23332200028200. Its totient is φ = 3798645782400.
The previous prime is 11111221011923. The next prime is 11111221012027. The reversal of 11111221012010 is 1021012211111.
It can be written as a sum of positive squares in 4 ways, for example, as 9357352522441 + 1753868489569 = 3058979^2 + 1324337^2 .
It is a Harshad number since it is a multiple of its sum of digits (14).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 32316041 + ... + 32658060.
Almost surely, 211111221012010 is an apocalyptic number.
11111221012010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11111221012010 is an abundant number, since it is smaller than the sum of its proper divisors (12220979016190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11111221012010 is a wasteful number, since it uses less digits than its factorization.
11111221012010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64974471 (or 64974464 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 11111221012010 its reverse (1021012211111), we get a palindrome (12132233223121).
The spelling of 11111221012010 in words is "eleven trillion, one hundred eleven billion, two hundred twenty-one million, twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •