Base | Representation |
---|---|
bin | 10100101011001110… |
… | …10011100000101110 |
3 | 1001122120200121212012 |
4 | 22111213103200232 |
5 | 140213102341220 |
6 | 5033240241222 |
7 | 542032545206 |
oct | 122547234056 |
9 | 31576617765 |
10 | 11100043310 |
11 | 4786759914 |
12 | 2199470212 |
13 | 107b884a85 |
14 | 7742b3406 |
15 | 44e751ac5 |
hex | 2959d382e |
11100043310 has 32 divisors (see below), whose sum is σ = 20163727872. Its totient is φ = 4399390720.
The previous prime is 11100043309. The next prime is 11100043373. The reversal of 11100043310 is 1334000111.
11100043310 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×111000433102 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 479564 + ... + 502176.
It is an arithmetic number, because the mean of its divisors is an integer number (630116496).
Almost surely, 211100043310 is an apocalyptic number.
11100043310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11100043310 is a deficient number, since it is larger than the sum of its proper divisors (9063684562).
11100043310 is a wasteful number, since it uses less digits than its factorization.
11100043310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23068.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 11100043310 its reverse (1334000111), we get a palindrome (12434043421).
The spelling of 11100043310 in words is "eleven billion, one hundred million, forty-three thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •