Base | Representation |
---|---|
bin | 11101011111000100001… |
… | …00110011000100000111 |
3 | 10120212000101121202121222 |
4 | 32233202010303010013 |
5 | 113044322204114421 |
6 | 2053225540030555 |
7 | 133123546544600 |
oct | 16574204630407 |
9 | 3525011552558 |
10 | 1013110223111 |
11 | 360726344628 |
12 | 14442069245b |
13 | 746c74502cc |
14 | 3706b6a4da7 |
15 | 1b5476dbcab |
hex | ebe2133107 |
1013110223111 has 12 divisors (see below), whose sum is σ = 1178611125120. Its totient is φ = 868310079840.
The previous prime is 1013110223039. The next prime is 1013110223123. The reversal of 1013110223111 is 1113220113101.
It is a de Polignac number, because none of the positive numbers 2k-1013110223111 is a prime.
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 1013110223111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1013110223131) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 216950 + ... + 1439891.
It is an arithmetic number, because the mean of its divisors is an integer number (98217593760).
Almost surely, 21013110223111 is an apocalyptic number.
1013110223111 is a deficient number, since it is larger than the sum of its proper divisors (165500902009).
1013110223111 is a wasteful number, since it uses less digits than its factorization.
1013110223111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1669334 (or 1669327 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 1013110223111 its reverse (1113220113101), we get a palindrome (2126330336212).
The spelling of 1013110223111 in words is "one trillion, thirteen billion, one hundred ten million, two hundred twenty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •