Base | Representation |
---|---|
bin | 10000010100010011011… |
… | …010010010010010011101 |
3 | 10222012022011120202000002 |
4 | 100110103122102102131 |
5 | 121332421400401023 |
6 | 2215042414144045 |
7 | 144004105530026 |
oct | 20242332222235 |
9 | 3865264522002 |
10 | 1121312122013 |
11 | 3a2600507776 |
12 | 1613991b2025 |
13 | 8197c273565 |
14 | 3c3b3b47c4d |
15 | 1e27ba03b28 |
hex | 1051369249d |
1121312122013 has 8 divisors (see below), whose sum is σ = 1187318787840. Its totient is φ = 1055310692800.
The previous prime is 1121312121973. The next prime is 1121312122031. The reversal of 1121312122013 is 3102212131211.
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 1121312122013 - 210 = 1121312120989 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121312122313) 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 7 ways as a sum of consecutive naturals, for example, 863963 + ... + 1728888.
It is an arithmetic number, because the mean of its divisors is an integer number (148414848480).
Almost surely, 21121312122013 is an apocalyptic number.
It is an amenable number.
1121312122013 is a deficient number, since it is larger than the sum of its proper divisors (66006665827).
1121312122013 is a wasteful number, since it uses less digits than its factorization.
1121312122013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2618307.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 1121312122013 its reverse (3102212131211), we get a palindrome (4223524253224).
The spelling of 1121312122013 in words is "one trillion, one hundred twenty-one billion, three hundred twelve million, one hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •