Base | Representation |
---|---|
bin | 10000001011101001100… |
… | …100000101011110101011 |
3 | 10221022022121000210101002 |
4 | 100023221210011132223 |
5 | 121204404122111243 |
6 | 2210504402145215 |
7 | 143224616001500 |
oct | 20135144053653 |
9 | 3838277023332 |
10 | 1112020113323 |
11 | 399672400049 |
12 | 15b62535220b |
13 | 80b2b162972 |
14 | 3bb71a3d4a7 |
15 | 1ddd5d95eb8 |
hex | 102e99057ab |
1112020113323 has 12 divisors (see below), whose sum is σ = 1298383259760. Its totient is φ = 949616739792.
The previous prime is 1112020113319. The next prime is 1112020113389. The reversal of 1112020113323 is 3233110202111.
It is a happy number.
It is not a de Polignac number, because 1112020113323 - 22 = 1112020113319 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1112020113295 and 1112020113304.
It is not an unprimeable number, because it can be changed into a prime (1112020112323) 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, 42169511 + ... + 42195872.
It is an arithmetic number, because the mean of its divisors is an integer number (108198604980).
Almost surely, 21112020113323 is an apocalyptic number.
1112020113323 is a deficient number, since it is larger than the sum of its proper divisors (186363146437).
1112020113323 is an equidigital number, since it uses as much as digits as its factorization.
1112020113323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84365666 (or 84365659 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1112020113323 its reverse (3233110202111), we get a palindrome (4345130315434).
The spelling of 1112020113323 in words is "one trillion, one hundred twelve billion, twenty million, one hundred thirteen thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •