Base | Representation |
---|---|
bin | 1010001000011100001001… |
… | …0100011000111001101110 |
3 | 1110102222120102221120012010 |
4 | 2202013002110120321232 |
5 | 2430004421220321220 |
6 | 35405410202022050 |
7 | 2226563214242043 |
oct | 242070224307156 |
9 | 43388512846163 |
10 | 11140110323310 |
11 | 3605548945641 |
12 | 12bb0404a7926 |
13 | 62a67ab025c7 |
14 | 2a72816c11ca |
15 | 144ba6e1e1e0 |
hex | a21c2518e6e |
11140110323310 has 32 divisors (see below), whose sum is σ = 26757168906240. Its totient is φ = 2968373405088.
The previous prime is 11140110323269. The next prime is 11140110323333. The reversal of 11140110323310 is 1332301104111.
It is a super-2 number, since 2×111401103233102 (a number of 27 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 145128562 + ... + 145205301.
It is an arithmetic number, because the mean of its divisors is an integer number (836161528320).
Almost surely, 211140110323310 is an apocalyptic number.
11140110323310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11140110323310 is an abundant number, since it is smaller than the sum of its proper divisors (15617058582930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11140110323310 is a wasteful number, since it uses less digits than its factorization.
11140110323310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 290335152.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 11140110323310 its reverse (1332301104111), we get a palindrome (12472411427421).
The spelling of 11140110323310 in words is "eleven trillion, one hundred forty billion, one hundred ten million, three hundred twenty-three thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •