Base | Representation |
---|---|
bin | 10000010100011001011… |
… | …011100001110110111110 |
3 | 10222012120012121112011110 |
4 | 100110121123201312332 |
5 | 121333123224024410 |
6 | 2215100422502450 |
7 | 144006443112156 |
oct | 20243133416676 |
9 | 3865505545143 |
10 | 1121413111230 |
11 | 3a2652514435 |
12 | 161406b94a26 |
13 | 819971723a9 |
14 | 3c3c3315766 |
15 | 1e285801720 |
hex | 105196e1dbe |
1121413111230 has 16 divisors (see below), whose sum is σ = 2691391467024. Its totient is φ = 299043496320.
The previous prime is 1121413111223. The next prime is 1121413111253. The reversal of 1121413111230 is 321113141211.
It is a happy number.
It is a super-2 number, since 2×11214131112302 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1121413111197 and 1121413111206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18690218491 + ... + 18690218550.
It is an arithmetic number, because the mean of its divisors is an integer number (168211966689).
Almost surely, 21121413111230 is an apocalyptic number.
1121413111230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1121413111230 is an abundant number, since it is smaller than the sum of its proper divisors (1569978355794).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1121413111230 is a wasteful number, since it uses less digits than its factorization.
1121413111230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37380437051.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 1121413111230 its reverse (321113141211), we get a palindrome (1442526252441).
The spelling of 1121413111230 in words is "one trillion, one hundred twenty-one billion, four hundred thirteen million, one hundred eleven thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •