Base | Representation |
---|---|
bin | 1100101001000… |
… | …11011110011101 |
3 | 21101112222021210 |
4 | 12110203132131 |
5 | 204122121420 |
6 | 14305015033 |
7 | 2425265001 |
oct | 624433635 |
9 | 241488253 |
10 | 106051485 |
11 | 54955061 |
12 | 2b624479 |
13 | 18c82077 |
14 | 10128701 |
15 | 949c9e0 |
hex | 652379d |
106051485 has 8 divisors (see below), whose sum is σ = 169682400. Its totient is φ = 56560784.
The previous prime is 106051453. The next prime is 106051487. The reversal of 106051485 is 584150601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 106051485 - 25 = 106051453 is a prime.
It is a super-2 number, since 2×1060514852 = 22493834941410450, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106051487) 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, 3535035 + ... + 3535064.
It is an arithmetic number, because the mean of its divisors is an integer number (21210300).
Almost surely, 2106051485 is an apocalyptic number.
106051485 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
106051485 is a deficient number, since it is larger than the sum of its proper divisors (63630915).
106051485 is an equidigital number, since it uses as much as digits as its factorization.
106051485 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7070107.
The product of its (nonzero) digits is 4800, while the sum is 30.
The square root of 106051485 is about 10298.1301700843. The cubic root of 106051485 is about 473.3389590792.
It can be divided in two parts, 10605 and 1485, that added together give a triangular number (12090 = T155).
The spelling of 106051485 in words is "one hundred six million, fifty-one thousand, four hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •