Base | Representation |
---|---|
bin | 1100101111100… |
… | …01000000110001 |
3 | 21110010202010101 |
4 | 12113301000301 |
5 | 204331041421 |
6 | 14335032401 |
7 | 2435402311 |
oct | 627610061 |
9 | 243122111 |
10 | 106893361 |
11 | 5537a623 |
12 | 2b96b701 |
13 | 191b8313 |
14 | 102a7441 |
15 | 95b7191 |
hex | 65f1031 |
106893361 has 4 divisors (see below), whose sum is σ = 108094500. Its totient is φ = 105692224.
The previous prime is 106893349. The next prime is 106893383. The reversal of 106893361 is 163398601.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 69622336 + 37271025 = 8344^2 + 6105^2 .
It is a cyclic number.
It is not a de Polignac number, because 106893361 - 25 = 106893329 is a prime.
It is a super-2 number, since 2×1068933612 = 22852381251752642, which contains 22 as substring.
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 106893361.
It is not an unprimeable number, because it can be changed into a prime (106893461) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 600436 + ... + 600613.
It is an arithmetic number, because the mean of its divisors is an integer number (27023625).
Almost surely, 2106893361 is an apocalyptic number.
It is an amenable number.
106893361 is a deficient number, since it is larger than the sum of its proper divisors (1201139).
106893361 is an equidigital number, since it uses as much as digits as its factorization.
106893361 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1201138.
The product of its (nonzero) digits is 23328, while the sum is 37.
The square root of 106893361 is about 10338.9245572255. The cubic root of 106893361 is about 474.5881726868.
The spelling of 106893361 in words is "one hundred six million, eight hundred ninety-three thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •