Base | Representation |
---|---|
bin | 10000010100010110110… |
… | …001001101001010101111 |
3 | 10222012110002121002221020 |
4 | 100110112301031022233 |
5 | 121333030311240444 |
6 | 2215052145505223 |
7 | 144005361441402 |
oct | 20242661151257 |
9 | 3865402532836 |
10 | 1121368461999 |
11 | 3a262a298845 |
12 | 1613b4042213 |
13 | 8198ab3b626 |
14 | 3c3bb411d39 |
15 | 1e281932119 |
hex | 10516c4d2af |
1121368461999 has 4 divisors (see below), whose sum is σ = 1495157949336. Its totient is φ = 747578974664.
The previous prime is 1121368461991. The next prime is 1121368462007. The reversal of 1121368461999 is 9991648631211.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (1121368461991) and next prime (1121368462007).
It is a cyclic number.
It is not a de Polignac number, because 1121368461999 - 23 = 1121368461991 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121368461991) 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 3 ways as a sum of consecutive naturals, for example, 186894743664 + ... + 186894743669.
It is an arithmetic number, because the mean of its divisors is an integer number (373789487334).
Almost surely, 21121368461999 is an apocalyptic number.
1121368461999 is a deficient number, since it is larger than the sum of its proper divisors (373789487337).
1121368461999 is an equidigital number, since it uses as much as digits as its factorization.
1121368461999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 373789487336.
The product of its digits is 5038848, while the sum is 60.
The spelling of 1121368461999 in words is "one trillion, one hundred twenty-one billion, three hundred sixty-eight million, four hundred sixty-one thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •