Base | Representation |
---|---|
bin | 110001101111010011… |
… | …1010000101110101011 |
3 | 101012201001110220111010 |
4 | 1203132213100232223 |
5 | 3222223344033240 |
6 | 121023015435003 |
7 | 10500644303100 |
oct | 1433647205653 |
9 | 335631426433 |
10 | 106814049195 |
11 | 41332823117 |
12 | 1884b985a63 |
13 | a0c343a009 |
14 | 5254014aa7 |
15 | 2ba2572280 |
hex | 18de9d0bab |
106814049195 has 48 divisors (see below), whose sum is σ = 199995602688. Its totient is φ = 48536832960.
The previous prime is 106814049179. The next prime is 106814049203. The reversal of 106814049195 is 591940418601.
It is not a de Polignac number, because 106814049195 - 24 = 106814049179 is a prime.
It is a super-2 number, since 2×1068140491952 (a number of 23 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (48) coincides with the sum of the digits of its distinct prime factors.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 312361 + ... + 557850.
It is an arithmetic number, because the mean of its divisors is an integer number (4166575056).
Almost surely, 2106814049195 is an apocalyptic number.
106814049195 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
106814049195 is a deficient number, since it is larger than the sum of its proper divisors (93181553493).
106814049195 is a wasteful number, since it uses less digits than its factorization.
106814049195 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 870400 (or 870393 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 48.
The spelling of 106814049195 in words is "one hundred six billion, eight hundred fourteen million, forty-nine thousand, one hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •