Base | Representation |
---|---|
bin | 10001110001010001001… |
… | …001011101001101011101 |
3 | 11022201221210120022220001 |
4 | 101301101021131031131 |
5 | 130001334312124001 |
6 | 2332551431454301 |
7 | 154136535655462 |
oct | 21612111351535 |
9 | 4281853508801 |
10 | 1221132145501 |
11 | 430974296854 |
12 | 1787b6827391 |
13 | 8b1c96b9a08 |
14 | 43162d19669 |
15 | 21b7003c001 |
hex | 11c5125d35d |
1221132145501 has 8 divisors (see below), whose sum is σ = 1229362031808. Its totient is φ = 1212904140000.
The previous prime is 1221132145487. The next prime is 1221132145553. The reversal of 1221132145501 is 1055412311221.
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 1221132145501 - 211 = 1221132143453 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1221132145501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1221132145561) 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, 845046 + ... + 1776616.
It is an arithmetic number, because the mean of its divisors is an integer number (153670253976).
Almost surely, 21221132145501 is an apocalyptic number.
It is an amenable number.
1221132145501 is a deficient number, since it is larger than the sum of its proper divisors (8229886307).
1221132145501 is an equidigital number, since it uses as much as digits as its factorization.
1221132145501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 940403.
The product of its (nonzero) digits is 2400, while the sum is 28.
Adding to 1221132145501 its reverse (1055412311221), we get a palindrome (2276544456722).
The spelling of 1221132145501 in words is "one trillion, two hundred twenty-one billion, one hundred thirty-two million, one hundred forty-five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •