Base | Representation |
---|---|
bin | 1011000101100110000001… |
… | …1100001110000000000000 |
3 | 1121011102102021222222200220 |
4 | 2301121200130032000000 |
5 | 3044213111202234120 |
6 | 41532202455143040 |
7 | 2365515532305423 |
oct | 261314034160000 |
9 | 47142367888626 |
10 | 12190735196160 |
11 | 398007522a824 |
12 | 144a790674a80 |
13 | 6a5773434ac1 |
14 | 30206b4379ba |
15 | 162197d0cb40 |
hex | b166070e000 |
12190735196160 has 224 divisors, whose sum is σ = 39256492167072. Its totient is φ = 3230151475200.
The previous prime is 12190735196131. The next prime is 12190735196183. The reversal of 12190735196160 is 6169153709121.
It is a super-2 number, since 2×121907351961602 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18976210 + ... + 19608110.
Almost surely, 212190735196160 is an apocalyptic number.
12190735196160 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 12190735196160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19628246083536).
12190735196160 is an abundant number, since it is smaller than the sum of its proper divisors (27065756970912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12190735196160 is an equidigital number, since it uses as much as digits as its factorization.
12190735196160 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 632092 (or 632068 counting only the distinct ones).
The product of its (nonzero) digits is 612360, while the sum is 51.
The spelling of 12190735196160 in words is "twelve trillion, one hundred ninety billion, seven hundred thirty-five million, one hundred ninety-six thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •