Base | Representation |
---|---|
bin | 11000000111011001100110… |
… | …000100000100011100111110 |
3 | 111220112101121200111210201110 |
4 | 120013121212010010130332 |
5 | 102400203211444002040 |
6 | 1013324013052222450 |
7 | 31224462116323053 |
oct | 3007314604043476 |
9 | 456471550453643 |
10 | 106061634750270 |
11 | 30881539882771 |
12 | ba8b556a6aa26 |
13 | 4724752814b74 |
14 | 1c295a663302a |
15 | c3dd8e770980 |
hex | 60766610473e |
106061634750270 has 16 divisors (see below), whose sum is σ = 254547923400720. Its totient is φ = 28283102600064.
The previous prime is 106061634750233. The next prime is 106061634750311. The reversal of 106061634750270 is 72057436160601.
It is a happy number.
It is a super-2 number, since 2×1060616347502702 (a number of 29 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 7 ways as a sum of consecutive naturals, for example, 1767693912475 + ... + 1767693912534.
It is an arithmetic number, because the mean of its divisors is an integer number (15909245212545).
Almost surely, 2106061634750270 is an apocalyptic number.
106061634750270 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106061634750270 is an abundant number, since it is smaller than the sum of its proper divisors (148486288650450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106061634750270 is a wasteful number, since it uses less digits than its factorization.
106061634750270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3535387825019.
The product of its (nonzero) digits is 1270080, while the sum is 48.
The spelling of 106061634750270 in words is "one hundred six trillion, sixty-one billion, six hundred thirty-four million, seven hundred fifty thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •