Base | Representation |
---|---|
bin | 110001011000011000… |
… | …1100101011100001101 |
3 | 101010201110101100011110 |
4 | 1202300301211130031 |
5 | 3214140010103113 |
6 | 120414424242233 |
7 | 10442615441340 |
oct | 1426061453415 |
9 | 333643340143 |
10 | 106045003533 |
11 | 40a78704797 |
12 | 18676310379 |
13 | a000004601 |
14 | 51bdc26457 |
15 | 2b59cb1bc3 |
hex | 18b0c6570d |
106045003533 has 8 divisors (see below), whose sum is σ = 161592386368. Its totient is φ = 60597144864.
The previous prime is 106045003531. The next prime is 106045003573. The reversal of 106045003533 is 335300540601.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106045003533 - 21 = 106045003531 is a prime.
It is a super-2 number, since 2×1060450035332 (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 106045003533.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106045003531) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 2524881016 + ... + 2524881057.
It is an arithmetic number, because the mean of its divisors is an integer number (20199048296).
Almost surely, 2106045003533 is an apocalyptic number.
It is an amenable number.
106045003533 is a deficient number, since it is larger than the sum of its proper divisors (55547382835).
106045003533 is an equidigital number, since it uses as much as digits as its factorization.
106045003533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5049762083.
The product of its (nonzero) digits is 16200, while the sum is 30.
The spelling of 106045003533 in words is "one hundred six billion, forty-five million, three thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •