Base | Representation |
---|---|
bin | 10000011100100101001… |
… | …100000110111100100100 |
3 | 11000001020121022111020020 |
4 | 100130211030012330210 |
5 | 122004122241030040 |
6 | 2223112403235140 |
7 | 144440263203636 |
oct | 20344514067444 |
9 | 4001217274206 |
10 | 1130200330020 |
11 | 3a6351692a23 |
12 | 163059978ab0 |
13 | 82767811938 |
14 | 3c9b837ca56 |
15 | 1e5ebe9bcd0 |
hex | 10725306f24 |
1130200330020 has 24 divisors (see below), whose sum is σ = 3164560924224. Its totient is φ = 301386754656.
The previous prime is 1130200329971. The next prime is 1130200330031. The reversal of 1130200330020 is 200330020311.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9418336024 + ... + 9418336143.
It is an arithmetic number, because the mean of its divisors is an integer number (131856705176).
Almost surely, 21130200330020 is an apocalyptic number.
1130200330020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1130200330020 is an abundant number, since it is smaller than the sum of its proper divisors (2034360594204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1130200330020 is a wasteful number, since it uses less digits than its factorization.
1130200330020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18836672179 (or 18836672177 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 1130200330020 its reverse (200330020311), we get a palindrome (1330530350331).
The spelling of 1130200330020 in words is "one trillion, one hundred thirty billion, two hundred million, three hundred thirty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •