Base | Representation |
---|---|
bin | 110011001011111100… |
… | …0001010001100101000 |
3 | 101111201200010120102100 |
4 | 1212113320022030220 |
5 | 3300110044420343 |
6 | 122255251333400 |
7 | 10640655553305 |
oct | 1462770121450 |
9 | 344650116370 |
10 | 109922263848 |
11 | 42688285861 |
12 | 193788b1260 |
13 | a49a380097 |
14 | 546ab4a0ac |
15 | 2cd538e9d3 |
hex | 1997e0a328 |
109922263848 has 48 divisors (see below), whose sum is σ = 297721457280. Its totient is φ = 36638868384.
The previous prime is 109922263807. The next prime is 109922263879. The reversal of 109922263848 is 848362229901.
It is a Smith number, since the sum of its digits (54) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 109922263794 and 109922263803.
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, 2505961 + ... + 2549447.
It is an arithmetic number, because the mean of its divisors is an integer number (6202530360).
Almost surely, 2109922263848 is an apocalyptic number.
109922263848 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
109922263848 is an abundant number, since it is smaller than the sum of its proper divisors (187799193432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109922263848 is a wasteful number, since it uses less digits than its factorization.
109922263848 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78606 (or 78599 counting only the distinct ones).
The product of its (nonzero) digits is 2985984, while the sum is 54.
The spelling of 109922263848 in words is "one hundred nine billion, nine hundred twenty-two million, two hundred sixty-three thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •