Base | Representation |
---|---|
bin | 11000000111001110110011… |
… | …100011110110111001100010 |
3 | 111220111021201022210220002120 |
4 | 120013032303203312321202 |
5 | 102400011000301331411 |
6 | 1013314415335325110 |
7 | 31223602046646003 |
oct | 3007166343667142 |
9 | 456437638726076 |
10 | 106050050027106 |
11 | 30877634580799 |
12 | ba89263220796 |
13 | 47236277102a3 |
14 | 1c28bc7c351aa |
15 | c3d9126d0106 |
hex | 6073b38f6e62 |
106050050027106 has 64 divisors (see below), whose sum is σ = 224105317201920. Its totient is φ = 33363201481920.
The previous prime is 106050050027099. The next prime is 106050050027267. The reversal of 106050050027106 is 601720050050601.
It is a super-2 number, since 2×1060500500271062 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 398615880 + ... + 398881836.
It is an arithmetic number, because the mean of its divisors is an integer number (3501645581280).
Almost surely, 2106050050027106 is an apocalyptic number.
106050050027106 is an abundant number, since it is smaller than the sum of its proper divisors (118055267174814).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106050050027106 is a wasteful number, since it uses less digits than its factorization.
106050050027106 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 279159.
The product of its (nonzero) digits is 12600, while the sum is 33.
The spelling of 106050050027106 in words is "one hundred six trillion, fifty billion, fifty million, twenty-seven thousand, one hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •