Base | Representation |
---|---|
bin | 10000010101001111100… |
… | …011010110001000011101 |
3 | 10222021220111012122202202 |
4 | 100111033203112020131 |
5 | 121342003202130023 |
6 | 2215330500501245 |
7 | 144041110126226 |
oct | 20251743261035 |
9 | 3867814178682 |
10 | 1122321130013 |
11 | 3a2a79023386 |
12 | 16161b0aa825 |
13 | 81ab0315905 |
14 | 3c46bb5c24d |
15 | 1e2da3b4128 |
hex | 1054f8d621d |
1122321130013 has 8 divisors (see below), whose sum is σ = 1152603665280. Its totient is φ = 1092305401600.
The previous prime is 1122321129991. The next prime is 1122321130019. The reversal of 1122321130013 is 3100311232211.
It is a happy number.
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 1122321130013 - 236 = 1053601653277 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122321130019) 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 7 ways as a sum of consecutive naturals, for example, 66693188 + ... + 66710013.
It is an arithmetic number, because the mean of its divisors is an integer number (144075458160).
Almost surely, 21122321130013 is an apocalyptic number.
It is an amenable number.
1122321130013 is a deficient number, since it is larger than the sum of its proper divisors (30282535267).
1122321130013 is a wasteful number, since it uses less digits than its factorization.
1122321130013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133403427.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1122321130013 its reverse (3100311232211), we get a palindrome (4222632362224).
The spelling of 1122321130013 in words is "one trillion, one hundred twenty-two billion, three hundred twenty-one million, one hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •