Base | Representation |
---|---|
bin | 110001011111101011… |
… | …1110000111010111100 |
3 | 101011100112012000102122 |
4 | 1202333113300322330 |
5 | 3220140203034202 |
6 | 120455013142112 |
7 | 10451651120060 |
oct | 1427727607274 |
9 | 334315160378 |
10 | 106289893052 |
11 | 41093967922 |
12 | 1872432a938 |
13 | a03b977b55 |
14 | 5204571aa0 |
15 | 2b715369a2 |
hex | 18bf5f0ebc |
106289893052 has 24 divisors (see below), whose sum is σ = 212625003360. Its totient is φ = 45543121920.
The previous prime is 106289893013. The next prime is 106289893069. The reversal of 106289893052 is 250398982601.
It is a super-2 number, since 2×1062898930522 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (53) 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 = 106289892985 and 106289893003.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 268949 + ... + 533772.
It is an arithmetic number, because the mean of its divisors is an integer number (8859375140).
Almost surely, 2106289893052 is an apocalyptic number.
It is an amenable number.
106289893052 is an abundant number, since it is smaller than the sum of its proper divisors (106335110308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106289893052 is a wasteful number, since it uses less digits than its factorization.
106289893052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 807461 (or 807459 counting only the distinct ones).
The product of its (nonzero) digits is 1866240, while the sum is 53.
The spelling of 106289893052 in words is "one hundred six billion, two hundred eighty-nine million, eight hundred ninety-three thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •