Base | Representation |
---|---|
bin | 1100101001000… |
… | …10000001111011 |
3 | 21101112200011110 |
4 | 12110202001323 |
5 | 204121424223 |
6 | 14304531403 |
7 | 2425241511 |
oct | 624420173 |
9 | 241480143 |
10 | 106045563 |
11 | 54950668 |
12 | 2b620b63 |
13 | 18c7c470 |
14 | 101264b1 |
15 | 949ad93 |
hex | 652207b |
106045563 has 8 divisors (see below), whose sum is σ = 152270608. Its totient is φ = 65258784.
The previous prime is 106045561. The next prime is 106045579. The reversal of 106045563 is 365540601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106045563 - 21 = 106045561 is a prime.
It is a super-3 number, since 3×1060455633 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 106045563.
It is not an unprimeable number, because it can be changed into a prime (106045561) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1359520 + ... + 1359597.
It is an arithmetic number, because the mean of its divisors is an integer number (19033826).
Almost surely, 2106045563 is an apocalyptic number.
106045563 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
106045563 is a deficient number, since it is larger than the sum of its proper divisors (46225045).
106045563 is a wasteful number, since it uses less digits than its factorization.
106045563 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2719133.
The product of its (nonzero) digits is 10800, while the sum is 30.
The square root of 106045563 is about 10297.8426381451. The cubic root of 106045563 is about 473.3301483728.
The spelling of 106045563 in words is "one hundred six million, forty-five thousand, five hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •