Base | Representation |
---|---|
bin | 10000010100111110000… |
… | …000010011110111001000 |
3 | 10222021010222020201222200 |
4 | 100110332000103313020 |
5 | 121340402320424000 |
6 | 2215241342520200 |
7 | 144030603604005 |
oct | 20247600236710 |
9 | 3867128221880 |
10 | 1122026733000 |
11 | 3a2937926568 |
12 | 161558596060 |
13 | 81a6432a1b4 |
14 | 3c440a068ac |
15 | 1e2be610500 |
hex | 1053e013dc8 |
1122026733000 has 768 divisors, whose sum is σ = 4113796377600. Its totient is φ = 274982400000.
The previous prime is 1122026732999. The next prime is 1122026733031. The reversal of 1122026733000 is 3376202211.
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 191 ways as a sum of consecutive naturals, for example, 1866932700 + ... + 1866933300.
It is an arithmetic number, because the mean of its divisors is an integer number (5356505700).
Almost surely, 21122026733000 is an apocalyptic number.
1122026733000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1122026733000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2056898188800).
1122026733000 is an abundant number, since it is smaller than the sum of its proper divisors (2991769644600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1122026733000 is a wasteful number, since it uses less digits than its factorization.
1122026733000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 991 (or 974 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 27.
The spelling of 1122026733000 in words is "one trillion, one hundred twenty-two billion, twenty-six million, seven hundred thirty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •