Base | Representation |
---|---|
bin | 10000010100001101100… |
… | …110000101010111010001 |
3 | 10222012001100222122102120 |
4 | 100110031212011113101 |
5 | 121332221411122010 |
6 | 2215025011004453 |
7 | 144001512303636 |
oct | 20241546052721 |
9 | 3865040878376 |
10 | 1121214551505 |
11 | 3a2560425594 |
12 | 161370599729 |
13 | 81964ca0829 |
14 | 3c3a4bca18d |
15 | 1e27317de70 |
hex | 1050d9855d1 |
1121214551505 has 8 divisors (see below), whose sum is σ = 1793943282432. Its totient is φ = 597981094128.
The previous prime is 1121214551497. The next prime is 1121214551531. The reversal of 1121214551505 is 5051554121211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1121214551505 - 23 = 1121214551497 is a prime.
It is an unprimeable number.
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, 37373818369 + ... + 37373818398.
It is an arithmetic number, because the mean of its divisors is an integer number (224242910304).
Almost surely, 21121214551505 is an apocalyptic number.
1121214551505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1121214551505 is a deficient number, since it is larger than the sum of its proper divisors (672728730927).
1121214551505 is an equidigital number, since it uses as much as digits as its factorization.
1121214551505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74747636775.
The product of its (nonzero) digits is 10000, while the sum is 33.
Adding to 1121214551505 its reverse (5051554121211), we get a palindrome (6172768672716).
The spelling of 1121214551505 in words is "one trillion, one hundred twenty-one billion, two hundred fourteen million, five hundred fifty-one thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •