Base | Representation |
---|---|
bin | 10000010011000101011… |
… | …001001110001001000010 |
3 | 10222001220221122122001000 |
4 | 100103011121032021002 |
5 | 121322231311020114 |
6 | 2214304455552430 |
7 | 143626503202206 |
oct | 20230531161102 |
9 | 3861827578030 |
10 | 1120003220034 |
11 | 3a1a9968a2a6 |
12 | 16109298b716 |
13 | 8180103c74a |
14 | 3c2cbd8ab06 |
15 | 1e201b55e09 |
hex | 104c564e242 |
1120003220034 has 16 divisors (see below), whose sum is σ = 2488896044640. Its totient is φ = 373334406660.
The previous prime is 1120003220033. The next prime is 1120003220051. The reversal of 1120003220034 is 4300223000211.
It is a super-2 number, since 2×11200032200342 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 1120003219989 and 1120003220016.
It is not an unprimeable number, because it can be changed into a prime (1120003220033) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10370400132 + ... + 10370400239.
It is an arithmetic number, because the mean of its divisors is an integer number (155556002790).
Almost surely, 21120003220034 is an apocalyptic number.
1120003220034 is an abundant number, since it is smaller than the sum of its proper divisors (1368892824606).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1120003220034 is a wasteful number, since it uses less digits than its factorization.
1120003220034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20740800382 (or 20740800376 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 1120003220034 its reverse (4300223000211), we get a palindrome (5420226220245).
The spelling of 1120003220034 in words is "one trillion, one hundred twenty billion, three million, two hundred twenty thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •