Base | Representation |
---|---|
bin | 10000010011000101011… |
… | …000110011100110010001 |
3 | 10222001220221110002220022 |
4 | 100103011120303212101 |
5 | 121322231244030223 |
6 | 2214304453353225 |
7 | 143626502240222 |
oct | 20230530634621 |
9 | 3861827402808 |
10 | 1120003111313 |
11 | 3a1a99615649 |
12 | 161092938815 |
13 | 81801002108 |
14 | 3c2cbd5d249 |
15 | 1e201b33ac8 |
hex | 104c5633991 |
1120003111313 has 16 divisors (see below), whose sum is σ = 1158006474240. Its totient is φ = 1082117836800.
The previous prime is 1120003111291. The next prime is 1120003111321. The reversal of 1120003111313 is 3131113000211.
It is a cyclic number.
It is not a de Polignac number, because 1120003111313 - 212 = 1120003107217 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1120003111291 and 1120003111300.
It is not an unprimeable number, because it can be changed into a prime (1120003111343) 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 15 ways as a sum of consecutive naturals, for example, 105386906 + ... + 105397532.
It is an arithmetic number, because the mean of its divisors is an integer number (72375404640).
Almost surely, 21120003111313 is an apocalyptic number.
It is an amenable number.
1120003111313 is a deficient number, since it is larger than the sum of its proper divisors (38003362927).
1120003111313 is a wasteful number, since it uses less digits than its factorization.
1120003111313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15848.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 1120003111313 its reverse (3131113000211), we get a palindrome (4251116111524).
The spelling of 1120003111313 in words is "one trillion, one hundred twenty billion, three million, one hundred eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •