Base | Representation |
---|---|
bin | 10000010011100011010… |
… | …100100011111100110001 |
3 | 10222010012221102201000100 |
4 | 100103203110203330301 |
5 | 121324243330040441 |
6 | 2214430353343013 |
7 | 143645111013243 |
oct | 20234324437461 |
9 | 3863187381010 |
10 | 1120505315121 |
11 | 3a2227047815 |
12 | 1611b2b67a69 |
13 | 8188107932a |
14 | 3c33892a093 |
15 | 1e230c84cb6 |
hex | 104e3523f31 |
1120505315121 has 12 divisors (see below), whose sum is σ = 1618817389072. Its totient is φ = 746860599576.
The previous prime is 1120505315113. The next prime is 1120505315123. The reversal of 1120505315121 is 1215135050211.
It is a happy number.
1120505315121 is a `hidden beast` number, since 1 + 1 + 2 + 0 + 5 + 0 + 531 + 5 + 121 = 666.
It is not a de Polignac number, because 1120505315121 - 23 = 1120505315113 is a prime.
It is a super-3 number, since 3×11205053151213 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1120505315123) 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, 11862331 + ... + 11956416.
Almost surely, 21120505315121 is an apocalyptic number.
It is an amenable number.
1120505315121 is a deficient number, since it is larger than the sum of its proper divisors (498312073951).
1120505315121 is a wasteful number, since it uses less digits than its factorization.
1120505315121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23823980 (or 23823977 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 27.
The spelling of 1120505315121 in words is "one trillion, one hundred twenty billion, five hundred five million, three hundred fifteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •