Base | Representation |
---|---|
bin | 1100101001100… |
… | …10100110110111 |
3 | 21101200010022021 |
4 | 12110302212313 |
5 | 204131112323 |
6 | 14310214011 |
7 | 2425643461 |
oct | 624624667 |
9 | 241603267 |
10 | 106113463 |
11 | 54997685 |
12 | 2b654307 |
13 | 18ca4341 |
14 | 10143131 |
15 | 94b105d |
hex | 65329b7 |
106113463 has 4 divisors (see below), whose sum is σ = 106196328. Its totient is φ = 106030600.
The previous prime is 106113443. The next prime is 106113481. The reversal of 106113463 is 364311601.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 364311601 = 29 ⋅12562469.
It is a cyclic number.
It is not a de Polignac number, because 106113463 - 213 = 106105271 is a prime.
It is a super-2 number, since 2×1061134632 = 22520134059704738, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106113433) 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, 39481 + ... + 42082.
It is an arithmetic number, because the mean of its divisors is an integer number (26549082).
Almost surely, 2106113463 is an apocalyptic number.
106113463 is a deficient number, since it is larger than the sum of its proper divisors (82865).
106113463 is an equidigital number, since it uses as much as digits as its factorization.
106113463 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82864.
The product of its (nonzero) digits is 1296, while the sum is 25.
The square root of 106113463 is about 10301.1389176149. The cubic root of 106113463 is about 473.4311498014.
It can be divided in two parts, 106 and 113463, that added together give a square (113569 = 3372).
The spelling of 106113463 in words is "one hundred six million, one hundred thirteen thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.158 sec. • engine limits •