Base | Representation |
---|---|
bin | 10000010101111110101… |
… | …000111001001001010101 |
3 | 10222100221112200222010001 |
4 | 100111332220321021111 |
5 | 121400112421111201 |
6 | 2215541120531301 |
7 | 144066511643422 |
oct | 20257650711125 |
9 | 3870845628101 |
10 | 1123111113301 |
11 | 3a3343a42531 |
12 | 1617bb780b31 |
13 | 81ba7b9c448 |
14 | 3c504a3ad49 |
15 | 1e33490d301 |
hex | 1057ea39255 |
1123111113301 has 8 divisors (see below), whose sum is σ = 1124120877120. Its totient is φ = 1122101742912.
The previous prime is 1123111113283. The next prime is 1123111113317. The reversal of 1123111113301 is 1033111113211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1123111113301 - 217 = 1123110982229 is a prime.
It is a super-2 number, since 2×11231111133012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1123111113401) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5769901 + ... + 5961373.
It is an arithmetic number, because the mean of its divisors is an integer number (140515109640).
Almost surely, 21123111113301 is an apocalyptic number.
It is an amenable number.
1123111113301 is a deficient number, since it is larger than the sum of its proper divisors (1009763819).
1123111113301 is a wasteful number, since it uses less digits than its factorization.
1123111113301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 196715.
The product of its (nonzero) digits is 54, while the sum is 19.
Adding to 1123111113301 its reverse (1033111113211), we get a palindrome (2156222226512).
The spelling of 1123111113301 in words is "one trillion, one hundred twenty-three billion, one hundred eleven million, one hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •