Base | Representation |
---|---|
bin | 10000101001101001011… |
… | …111010101010100101101 |
3 | 11001101110102201120202122 |
4 | 100221221133111110231 |
5 | 122221341131402341 |
6 | 2233352540002325 |
7 | 145445054030435 |
oct | 20515137252455 |
9 | 4041412646678 |
10 | 1144231122221 |
11 | 4012a1702860 |
12 | 1659148303a5 |
13 | 83b92612245 |
14 | 3d54998d2c5 |
15 | 1eb6db6394b |
hex | 10a697d552d |
1144231122221 has 32 divisors (see below), whose sum is σ = 1328907202560. Its totient is φ = 974880878400.
The previous prime is 1144231122187. The next prime is 1144231122227. The reversal of 1144231122221 is 1222211324411.
It is a de Polignac number, because none of the positive numbers 2k-1144231122221 is a prime.
It is a super-2 number, since 2×11442311222212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1144231122227) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9851516 + ... + 9966986.
It is an arithmetic number, because the mean of its divisors is an integer number (41528350080).
Almost surely, 21144231122221 is an apocalyptic number.
1144231122221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1144231122221 is a deficient number, since it is larger than the sum of its proper divisors (184676080339).
1144231122221 is a wasteful number, since it uses less digits than its factorization.
1144231122221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116297.
The product of its digits is 1536, while the sum is 26.
Adding to 1144231122221 its reverse (1222211324411), we get a palindrome (2366442446632).
The spelling of 1144231122221 in words is "one trillion, one hundred forty-four billion, two hundred thirty-one million, one hundred twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •