Base | Representation |
---|---|
bin | 1100101100001… |
… | …11110110100111 |
3 | 21102022212021102 |
4 | 12112013312213 |
5 | 204223301011 |
6 | 14321510315 |
7 | 2431626452 |
oct | 626076647 |
9 | 242285242 |
10 | 106462631 |
11 | 55105a50 |
12 | 2b7a239b |
13 | 19097252 |
14 | 101d4499 |
15 | 952e73b |
hex | 6587da7 |
106462631 has 8 divisors (see below), whose sum is σ = 116240400. Its totient is φ = 96701440.
The previous prime is 106462613. The next prime is 106462633. The reversal of 106462631 is 136264601.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-106462631 is a prime.
It is a super-2 number, since 2×1064626312 = 22668583598884322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 106462594 and 106462603.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106462633) 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, 12065 + ... + 18933.
It is an arithmetic number, because the mean of its divisors is an integer number (14530050).
Almost surely, 2106462631 is an apocalyptic number.
106462631 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
106462631 is a deficient number, since it is larger than the sum of its proper divisors (9777769).
106462631 is a wasteful number, since it uses less digits than its factorization.
106462631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8289.
The product of its (nonzero) digits is 5184, while the sum is 29.
The square root of 106462631 is about 10318.0730274601. The cubic root of 106462631 is about 473.9498587967.
The spelling of 106462631 in words is "one hundred six million, four hundred sixty-two thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •