Base | Representation |
---|---|
bin | 10000010011011001000… |
… | …001000110001101110001 |
3 | 10222002202220010202112010 |
4 | 100103121001012031301 |
5 | 121323420101043213 |
6 | 2214401300153133 |
7 | 143640611422353 |
oct | 20233101061561 |
9 | 3862686122463 |
10 | 1120332440433 |
11 | 3a2148501478 |
12 | 1611650987a9 |
13 | 818542cb70b |
14 | 3c31d9a90d3 |
15 | 1e2209d7ac3 |
hex | 104d9046371 |
1120332440433 has 16 divisors (see below), whose sum is σ = 1554104385536. Its totient is φ = 717103815120.
The previous prime is 1120332440431. The next prime is 1120332440467. The reversal of 1120332440433 is 3340442330211.
It is a happy number.
It is not a de Polignac number, because 1120332440433 - 21 = 1120332440431 is a prime.
It is a super-2 number, since 2×11203324404332 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1120332440433.
It is not an unprimeable number, because it can be changed into a prime (1120332440431) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 47415691 + ... + 47439312.
It is an arithmetic number, because the mean of its divisors is an integer number (97131524096).
Almost surely, 21120332440433 is an apocalyptic number.
It is an amenable number.
1120332440433 is a deficient number, since it is larger than the sum of its proper divisors (433771945103).
1120332440433 is a wasteful number, since it uses less digits than its factorization.
1120332440433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94855164.
The product of its (nonzero) digits is 20736, while the sum is 30.
Adding to 1120332440433 its reverse (3340442330211), we get a palindrome (4460774770644).
The spelling of 1120332440433 in words is "one trillion, one hundred twenty billion, three hundred thirty-two million, four hundred forty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •