Base | Representation |
---|---|
bin | 1100101001001… |
… | …00000110110001 |
3 | 21101120002211100 |
4 | 12110210012301 |
5 | 204122212230 |
6 | 14305035013 |
7 | 2425305345 |
oct | 624440661 |
9 | 241502740 |
10 | 106054065 |
11 | 54956a97 |
12 | 2b625a69 |
13 | 18c832b0 |
14 | 10129625 |
15 | 949d660 |
hex | 65241b1 |
106054065 has 48 divisors (see below), whose sum is σ = 199180800. Its totient is φ = 51891840.
The previous prime is 106054061. The next prime is 106054111. The reversal of 106054065 is 560450601.
It is a happy number.
106054065 is a `hidden beast` number, since 1 + 0 + 60 + 540 + 65 = 666.
It is not a de Polignac number, because 106054065 - 22 = 106054061 is a prime.
It is a super-2 number, since 2×1060540652 = 22494929406048450, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106054061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 115960 + ... + 116870.
It is an arithmetic number, because the mean of its divisors is an integer number (4149600).
Almost surely, 2106054065 is an apocalyptic number.
106054065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
106054065 is a deficient number, since it is larger than the sum of its proper divisors (93126735).
106054065 is a wasteful number, since it uses less digits than its factorization.
106054065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1134 (or 1131 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The square root of 106054065 is about 10298.2554347812. The cubic root of 106054065 is about 473.3427974810.
The spelling of 106054065 in words is "one hundred six million, fifty-four thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •