Base | Representation |
---|---|
bin | 11111111011101010010… |
… | …10110010001111110000 |
3 | 10212220000112021222100000 |
4 | 33331311022302033300 |
5 | 120434012200001000 |
6 | 2200012203030000 |
7 | 142161126465300 |
oct | 17756512621760 |
9 | 3786015258300 |
10 | 1097182422000 |
11 | 393348967a35 |
12 | 15878420b300 |
13 | 7c605135162 |
14 | 3b1651c9600 |
15 | 1d818443000 |
hex | ff752b23f0 |
1097182422000 has 720 divisors, whose sum is σ = 4622942050272. Its totient is φ = 250779110400.
The previous prime is 1097182421969. The next prime is 1097182422029. The reversal of 1097182422000 is 2242817901.
It is a tau number, because it is divible by the number of its divisors (720).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 23790964 + ... + 23837036.
Almost surely, 21097182422000 is an apocalyptic number.
1097182422000 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 1097182422000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2311471025136).
1097182422000 is an abundant number, since it is smaller than the sum of its proper divisors (3525759628272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1097182422000 is an equidigital number, since it uses as much as digits as its factorization.
1097182422000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46125 (or 46090 counting only the distinct ones).
The product of its (nonzero) digits is 16128, while the sum is 36.
The spelling of 1097182422000 in words is "one trillion, ninety-seven billion, one hundred eighty-two million, four hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •