Base | Representation |
---|---|
bin | 1100101111001… |
… | …10000100000111 |
3 | 21110001110121120 |
4 | 12113212010013 |
5 | 204323123034 |
6 | 14334045023 |
7 | 2435124501 |
oct | 627460407 |
9 | 243043546 |
10 | 106848519 |
11 | 55349968 |
12 | 2b949773 |
13 | 191a0a9b |
14 | 10294d71 |
15 | 95a8c49 |
hex | 65e6107 |
106848519 has 16 divisors (see below), whose sum is σ = 151142112. Its totient is φ = 66910208.
The previous prime is 106848517. The next prime is 106848551. The reversal of 106848519 is 915848601.
It is a cyclic number.
It is not a de Polignac number, because 106848519 - 21 = 106848517 is a prime.
It is a super-3 number, since 3×1068485193 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106848517) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28477 + ... + 32009.
It is an arithmetic number, because the mean of its divisors is an integer number (9446382).
Almost surely, 2106848519 is an apocalyptic number.
106848519 is a deficient number, since it is larger than the sum of its proper divisors (44293593).
106848519 is a wasteful number, since it uses less digits than its factorization.
106848519 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4146.
The product of its (nonzero) digits is 69120, while the sum is 42.
The square root of 106848519 is about 10336.7557289509. The cubic root of 106848519 is about 474.5217998107.
The spelling of 106848519 in words is "one hundred six million, eight hundred forty-eight thousand, five hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •