Base | Representation |
---|---|
bin | 11000010100010001110110… |
… | …001111110010010010000000 |
3 | 112000200000001021120102101000 |
4 | 120110101312033302102000 |
5 | 103004203234344120000 |
6 | 1015242342143012000 |
7 | 31345433111616462 |
oct | 3024216617622200 |
9 | 460600037512330 |
10 | 106946669520000 |
11 | 31092911939562 |
12 | bbb2b9329a000 |
13 | 478a048a09c1b |
14 | 1c5a364286132 |
15 | c56ddd055000 |
hex | 6144763f2480 |
106946669520000 has 3840 divisors, whose sum is σ = 450777305088000. Its totient is φ = 24873246720000.
The previous prime is 106946669519917. The next prime is 106946669520007. The reversal of 106946669520000 is 25966649601.
It is a super-2 number, since 2×1069466695200002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is not an unprimeable number, because it can be changed into a prime (106946669520007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 479 ways as a sum of consecutive naturals, for example, 842099759937 + ... + 842099760063.
It is an arithmetic number, because the mean of its divisors is an integer number (117389923200).
Almost surely, 2106946669520000 is an apocalyptic number.
106946669520000 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 106946669520000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (225388652544000).
106946669520000 is an abundant number, since it is smaller than the sum of its proper divisors (343830635568000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106946669520000 is a wasteful number, since it uses less digits than its factorization.
106946669520000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 294 (or 244 counting only the distinct ones).
The product of its (nonzero) digits is 4199040, while the sum is 54.
The spelling of 106946669520000 in words is "one hundred six trillion, nine hundred forty-six billion, six hundred sixty-nine million, five hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •