Base | Representation |
---|---|
bin | 10000010100001111001… |
… | …001001001111010110111 |
3 | 10222012010011212002211102 |
4 | 100110033021021322313 |
5 | 121332300033204143 |
6 | 2215031335400315 |
7 | 144002246121620 |
oct | 20241711117267 |
9 | 3865104762742 |
10 | 1121240522423 |
11 | 3a257405395a |
12 | 16137922309b |
13 | 8196a494938 |
14 | 3c3a842aa47 |
15 | 1e2755ae0b8 |
hex | 1050f249eb7 |
1121240522423 has 8 divisors (see below), whose sum is σ = 1283693797248. Its totient is φ = 959356261944.
The previous prime is 1121240522417. The next prime is 1121240522429. The reversal of 1121240522423 is 3242250421211.
It is an interprime number because it is at equal distance from previous prime (1121240522417) and next prime (1121240522429).
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 1121240522423 - 26 = 1121240522359 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 (1121240522429) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 142249361 + ... + 142257242.
It is an arithmetic number, because the mean of its divisors is an integer number (160461724656).
Almost surely, 21121240522423 is an apocalyptic number.
1121240522423 is a deficient number, since it is larger than the sum of its proper divisors (162453274825).
1121240522423 is an equidigital number, since it uses as much as digits as its factorization.
1121240522423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 284507173.
The product of its (nonzero) digits is 7680, while the sum is 29.
Adding to 1121240522423 its reverse (3242250421211), we get a palindrome (4363490943634).
The spelling of 1121240522423 in words is "one trillion, one hundred twenty-one billion, two hundred forty million, five hundred twenty-two thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •