Base | Representation |
---|---|
bin | 110001011100101010… |
… | …0010011110110011100 |
3 | 101011002110001210020020 |
4 | 1202321110103312130 |
5 | 3214433202334002 |
6 | 120440544152140 |
7 | 10446305602113 |
oct | 1427124236634 |
9 | 334073053206 |
10 | 106188324252 |
11 | 410415a476a |
12 | 186b6308650 |
13 | a02390527a |
14 | 51d4c92c7a |
15 | 2b676722bc |
hex | 18b9513d9c |
106188324252 has 12 divisors (see below), whose sum is σ = 247772756616. Its totient is φ = 35396108080.
The previous prime is 106188324241. The next prime is 106188324269. The reversal of 106188324252 is 252423881601.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×1061883242522 (a number of 23 digits) contains 22 as substring.
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 3 ways as a sum of consecutive naturals, for example, 4424513499 + ... + 4424513522.
It is an arithmetic number, because the mean of its divisors is an integer number (20647729718).
Almost surely, 2106188324252 is an apocalyptic number.
106188324252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
106188324252 is an abundant number, since it is smaller than the sum of its proper divisors (141584432364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106188324252 is a wasteful number, since it uses less digits than its factorization.
106188324252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8849027028 (or 8849027026 counting only the distinct ones).
The product of its (nonzero) digits is 184320, while the sum is 42.
The spelling of 106188324252 in words is "one hundred six billion, one hundred eighty-eight million, three hundred twenty-four thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •