Base | Representation |
---|---|
bin | 1100100100001… |
… | …11111001010001 |
3 | 21100100121010120 |
4 | 12102013321101 |
5 | 203441223400 |
6 | 14243220453 |
7 | 2420002050 |
oct | 622077121 |
9 | 240317116 |
10 | 105414225 |
11 | 5455a2a4 |
12 | 2b377729 |
13 | 18abaca7 |
14 | 10000397 |
15 | 93c3ca0 |
hex | 6487e51 |
105414225 has 24 divisors (see below), whose sum is σ = 199183680. Its totient is φ = 48189120.
The previous prime is 105414193. The next prime is 105414269. The reversal of 105414225 is 522414501.
It is not a de Polignac number, because 105414225 - 25 = 105414193 is a prime.
It is a super-2 number, since 2×1054142252 = 22224317664701250, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105414195 and 105414204.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 99870 + ... + 100919.
It is an arithmetic number, because the mean of its divisors is an integer number (8299320).
Almost surely, 2105414225 is an apocalyptic number.
105414225 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
105414225 is a deficient number, since it is larger than the sum of its proper divisors (93769455).
105414225 is a wasteful number, since it uses less digits than its factorization.
105414225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200809 (or 200804 counting only the distinct ones).
The product of its (nonzero) digits is 1600, while the sum is 24.
The square root of 105414225 is about 10267.1429813751. The cubic root of 105414225 is about 472.3889607779.
Adding to 105414225 its reverse (522414501), we get a palindrome (627828726).
The spelling of 105414225 in words is "one hundred five million, four hundred fourteen thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •