Base | Representation |
---|---|
bin | 10000000001100110011… |
… | …111101111000101010001 |
3 | 10220021110200211101100002 |
4 | 100001212133233011101 |
5 | 121020310143114441 |
6 | 2201522034535345 |
7 | 142363351644221 |
oct | 20014637570521 |
9 | 3807420741302 |
10 | 1101231223121 |
11 | 395036353167 |
12 | 159514137555 |
13 | 7cacbbb2373 |
14 | 3b42ac04081 |
15 | 1d9a3b07b9b |
hex | 100667ef151 |
1101231223121 has 12 divisors (see below), whose sum is σ = 1162908043920. Its totient is φ = 1039936790880.
The previous prime is 1101231223109. The next prime is 1101231223139. The reversal of 1101231223121 is 1213221321011.
It is not a de Polignac number, because 1101231223121 - 214 = 1101231206737 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1101231223093 and 1101231223102.
It is not an unprimeable number, because it can be changed into a prime (1101231223321) 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 11 ways as a sum of consecutive naturals, for example, 1565606 + ... + 2157216.
It is an arithmetic number, because the mean of its divisors is an integer number (96909003660).
Almost surely, 21101231223121 is an apocalyptic number.
It is an amenable number.
1101231223121 is a deficient number, since it is larger than the sum of its proper divisors (61676820799).
1101231223121 is an frugal number, since it uses more digits than its factorization.
1101231223121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 592256 (or 591943 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 1101231223121 its reverse (1213221321011), we get a palindrome (2314452544132).
The spelling of 1101231223121 in words is "one trillion, one hundred one billion, two hundred thirty-one million, two hundred twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •