Base | Representation |
---|---|
bin | 1010001100000000001011… |
… | …1000101000111110101000 |
3 | 1110122211120110121022221110 |
4 | 2203000002320220332220 |
5 | 2432010302204012222 |
6 | 35453452232310320 |
7 | 2234161141322646 |
oct | 243000270507650 |
9 | 43584513538843 |
10 | 11201323110312 |
11 | 36294aa972505 |
12 | 130aa845423a0 |
13 | 6333848b022a |
14 | 2aa20b272196 |
15 | 14658ad8630c |
hex | a3002e28fa8 |
11201323110312 has 16 divisors (see below), whose sum is σ = 28003307775840. Its totient is φ = 3733774370096.
The previous prime is 11201323110277. The next prime is 11201323110389. The reversal of 11201323110312 is 21301132310211.
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 3 ways as a sum of consecutive naturals, for example, 233360898108 + ... + 233360898155.
It is an arithmetic number, because the mean of its divisors is an integer number (1750206735990).
Almost surely, 211201323110312 is an apocalyptic number.
11201323110312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11201323110312 is an abundant number, since it is smaller than the sum of its proper divisors (16801984665528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11201323110312 is a wasteful number, since it uses less digits than its factorization.
11201323110312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 466721796272 (or 466721796268 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 11201323110312 its reverse (21301132310211), we get a palindrome (32502455420523).
The spelling of 11201323110312 in words is "eleven trillion, two hundred one billion, three hundred twenty-three million, one hundred ten thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •