Base | Representation |
---|---|
bin | 10000010011000111001… |
… | …100000001000101101010 |
3 | 10222002000001021112000010 |
4 | 100103013030001011222 |
5 | 121322312012010010 |
6 | 2214311452552350 |
7 | 143630320036164 |
oct | 20230714010552 |
9 | 3862001245003 |
10 | 1120033313130 |
11 | 3a2004673726 |
12 | 1610a0a826b6 |
13 | 81807347c04 |
14 | 3c2d1d81934 |
15 | 1e2045ec620 |
hex | 104c730116a |
1120033313130 has 32 divisors (see below), whose sum is σ = 2701725041664. Its totient is φ = 297159429056.
The previous prime is 1120033313101. The next prime is 1120033313131. The reversal of 1120033313130 is 313133300211.
It is a junction number, because it is equal to n+sod(n) for n = 1120033313097 and 1120033313106.
It is not an unprimeable number, because it can be changed into a prime (1120033313131) 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, 94751562 + ... + 94763381.
It is an arithmetic number, because the mean of its divisors is an integer number (84428907552).
Almost surely, 21120033313130 is an apocalyptic number.
1120033313130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1120033313130 is an abundant number, since it is smaller than the sum of its proper divisors (1581691728534).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1120033313130 is a wasteful number, since it uses less digits than its factorization.
1120033313130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 189515150.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 1120033313130 its reverse (313133300211), we get a palindrome (1433166613341).
The spelling of 1120033313130 in words is "one trillion, one hundred twenty billion, thirty-three million, three hundred thirteen thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •