Base | Representation |
---|---|
bin | 1010000110101101001001… |
… | …0001100000001111010000 |
3 | 1110100010122211110110021012 |
4 | 2201223102101200033100 |
5 | 2424012410141400222 |
6 | 35344001334550052 |
7 | 2224456630161521 |
oct | 241532221401720 |
9 | 43303584413235 |
10 | 11110313231312 |
11 | 35a39481a0379 |
12 | 12b5305508328 |
13 | 62790c7a2319 |
14 | 2a5a561b4848 |
15 | 1440110261e2 |
hex | a1ad24603d0 |
11110313231312 has 20 divisors (see below), whose sum is σ = 22792480820676. Its totient is φ = 5228382696960.
The previous prime is 11110313231291. The next prime is 11110313231317. The reversal of 11110313231312 is 21313231301111.
It can be written as a sum of positive squares in 2 ways, for example, as 7435132841536 + 3675180389776 = 2726744^2 + 1917076^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11110313231317) by changing a digit.
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, 20423369639 + ... + 20423370182.
Almost surely, 211110313231312 is an apocalyptic number.
It is an amenable number.
11110313231312 is an abundant number, since it is smaller than the sum of its proper divisors (11682167589364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11110313231312 is a wasteful number, since it uses less digits than its factorization.
11110313231312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40846739846 (or 40846739840 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 23.
Adding to 11110313231312 its reverse (21313231301111), we get a palindrome (32423544532423).
The spelling of 11110313231312 in words is "eleven trillion, one hundred ten billion, three hundred thirteen million, two hundred thirty-one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •