Base | Representation |
---|---|
bin | 10000010011001101000… |
… | …001000011011011010101 |
3 | 10222002020212021201200201 |
4 | 100103031001003123111 |
5 | 121323012030234141 |
6 | 2214325304540501 |
7 | 143632615163152 |
oct | 20231501033325 |
9 | 3862225251621 |
10 | 1120131102421 |
11 | 3a2054895221 |
12 | 161109781731 |
13 | 818216963b6 |
14 | 3c300d59229 |
15 | 1e20ceb7031 |
hex | 104cd0436d5 |
1120131102421 has 16 divisors (see below), whose sum is σ = 1160055461248. Its totient is φ = 1081089504000.
The previous prime is 1120131102401. The next prime is 1120131102437. The reversal of 1120131102421 is 1242011310211.
It is a cyclic number.
It is not a de Polignac number, because 1120131102421 - 29 = 1120131101909 is a prime.
It is a super-2 number, since 2×11201311024212 (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 (1120131102401) 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, 19800 + ... + 1496881.
It is an arithmetic number, because the mean of its divisors is an integer number (72503466328).
Almost surely, 21120131102421 is an apocalyptic number.
It is an amenable number.
1120131102421 is a deficient number, since it is larger than the sum of its proper divisors (39924358827).
1120131102421 is a wasteful number, since it uses less digits than its factorization.
1120131102421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1516972.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 1120131102421 its reverse (1242011310211), we get a palindrome (2362142412632).
The spelling of 1120131102421 in words is "one trillion, one hundred twenty billion, one hundred thirty-one million, one hundred two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •