Base | Representation |
---|---|
bin | 11000000110100000001101… |
… | …101010010010100010001010 |
3 | 111220022111120210100121000122 |
4 | 120012200031222102202022 |
5 | 102343201021121230200 |
6 | 1013235423214303242 |
7 | 31220151235132034 |
oct | 3006401552224212 |
9 | 456274523317018 |
10 | 106000022055050 |
11 | 308583a2042942 |
12 | ba7b620ab7b22 |
13 | 471b9b3c28666 |
14 | 1c265dd902c54 |
15 | c3c485662385 |
hex | 60680da9288a |
106000022055050 has 24 divisors (see below), whose sum is σ = 197161100111136. Its totient is φ = 42399781061040.
The previous prime is 106000022055041. The next prime is 106000022055089. The reversal of 106000022055050 is 50550220000601.
It is a super-3 number, since 3×1060000220550503 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3865979 + ... + 15064721.
It is an arithmetic number, because the mean of its divisors is an integer number (8215045837964).
Almost surely, 2106000022055050 is an apocalyptic number.
106000022055050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106000022055050 is a deficient number, since it is larger than the sum of its proper divisors (91161078056086).
106000022055050 is a wasteful number, since it uses less digits than its factorization.
106000022055050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11388062 (or 11388057 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 26.
Adding to 106000022055050 its reverse (50550220000601), we get a palindrome (156550242055651).
The spelling of 106000022055050 in words is "one hundred six trillion, twenty-two million, fifty-five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •