Base | Representation |
---|---|
bin | 110001010100110011… |
… | …1001111011000010110 |
3 | 101010102002021222011212 |
4 | 1202221213033120112 |
5 | 3213413230214342 |
6 | 120354453101422 |
7 | 10436626244141 |
oct | 1425147173026 |
9 | 333362258155 |
10 | 105924851222 |
11 | 40a168a9563 |
12 | 18642027872 |
13 | 9cb1156278 |
14 | 51abcab058 |
15 | 2b4e47b182 |
hex | 18a99cf616 |
105924851222 has 16 divisors (see below), whose sum is σ = 165921212160. Its totient is φ = 50621274792.
The previous prime is 105924851209. The next prime is 105924851261. The reversal of 105924851222 is 222158429501.
105924851222 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1059248512222 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 105924851222.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 812228 + ... + 933575.
It is an arithmetic number, because the mean of its divisors is an integer number (10370075760).
Almost surely, 2105924851222 is an apocalyptic number.
105924851222 is a deficient number, since it is larger than the sum of its proper divisors (59996360938).
105924851222 is a wasteful number, since it uses less digits than its factorization.
105924851222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1747147.
The product of its (nonzero) digits is 115200, while the sum is 41.
The spelling of 105924851222 in words is "one hundred five billion, nine hundred twenty-four million, eight hundred fifty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •