Base | Representation |
---|---|
bin | 10000001101110010001… |
… | …110111011000110111011 |
3 | 10221112020101120202111201 |
4 | 100031302032323012323 |
5 | 121224103114410121 |
6 | 2211524111435031 |
7 | 143335500412000 |
oct | 20156216730673 |
9 | 3845211522451 |
10 | 1114313044411 |
11 | 39a639733116 |
12 | 15bb65225a77 |
13 | 81105201418 |
14 | 3bd0c38b8a7 |
15 | 1debc31ce91 |
hex | 103723bb1bb |
1114313044411 has 32 divisors (see below), whose sum is σ = 1368094464000. Its totient is φ = 904716933120.
The previous prime is 1114313044357. The next prime is 1114313044423. The reversal of 1114313044411 is 1144403134111.
It is not a de Polignac number, because 1114313044411 - 27 = 1114313044283 is a prime.
It is a super-2 number, since 2×11143130444112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1114313044411.
It is not an unprimeable number, because it can be changed into a prime (1114313045411) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 79128891 + ... + 79142971.
It is an arithmetic number, because the mean of its divisors is an integer number (42752952000).
Almost surely, 21114313044411 is an apocalyptic number.
1114313044411 is a deficient number, since it is larger than the sum of its proper divisors (253781419589).
1114313044411 is a wasteful number, since it uses less digits than its factorization.
1114313044411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26264 (or 26250 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 28.
Adding to 1114313044411 its reverse (1144403134111), we get a palindrome (2258716178522).
The spelling of 1114313044411 in words is "one trillion, one hundred fourteen billion, three hundred thirteen million, forty-four thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •