Base | Representation |
---|---|
bin | 10000001011111100001… |
… | …011011000011011011011 |
3 | 10221100010100122211020212 |
4 | 100023330023120123123 |
5 | 121211024043420233 |
6 | 2210555355441335 |
7 | 143235430302311 |
oct | 20137413303333 |
9 | 3840110584225 |
10 | 1112332404443 |
11 | 399812709a87 |
12 | 15b6b1a5624b |
13 | 80b7aa75100 |
14 | 3bba12d20b1 |
15 | 1de034d1a48 |
hex | 102fc2d86db |
1112332404443 has 12 divisors (see below), whose sum is σ = 1204513769448. Its totient is φ = 1026738123840.
The previous prime is 1112332404437. The next prime is 1112332404457. The reversal of 1112332404443 is 3444042332111.
It is not a de Polignac number, because 1112332404443 - 220 = 1112331355867 is a prime.
It is a super-2 number, since 2×11123324044432 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1112332404943) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7338503 + ... + 7488543.
It is an arithmetic number, because the mean of its divisors is an integer number (100376147454).
Almost surely, 21112332404443 is an apocalyptic number.
1112332404443 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1112332404443 is a deficient number, since it is larger than the sum of its proper divisors (92181365005).
1112332404443 is a wasteful number, since it uses less digits than its factorization.
1112332404443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 193934 (or 193921 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 32.
Adding to 1112332404443 its reverse (3444042332111), we get a palindrome (4556374736554).
The spelling of 1112332404443 in words is "one trillion, one hundred twelve billion, three hundred thirty-two million, four hundred four thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •