Base | Representation |
---|---|
bin | 1100101011110… |
… | …00111010110100 |
3 | 21102012202100211 |
4 | 12111320322310 |
5 | 204214321320 |
6 | 14320315204 |
7 | 2431253224 |
oct | 625707264 |
9 | 242182324 |
10 | 106401460 |
11 | 55073aa0 |
12 | 2b772b04 |
13 | 19075459 |
14 | 101ba084 |
15 | 951b55a |
hex | 6578eb4 |
106401460 has 24 divisors (see below), whose sum is σ = 243756576. Its totient is φ = 38691360.
The previous prime is 106401457. The next prime is 106401469. The reversal of 106401460 is 64104601.
It is a super-2 number, since 2×1064014602 = 22642541380263200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106401469) 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, 241602 + ... + 242041.
It is an arithmetic number, because the mean of its divisors is an integer number (10156524).
Almost surely, 2106401460 is an apocalyptic number.
106401460 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106401460 is an abundant number, since it is smaller than the sum of its proper divisors (137355116).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106401460 is a wasteful number, since it uses less digits than its factorization.
106401460 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 483663 (or 483661 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 22.
The square root of 106401460 is about 10315.1083368038. The cubic root of 106401460 is about 473.8590678120.
It can be divided in two parts, 10640 and 1460, that added together give a square (12100 = 1102).
The spelling of 106401460 in words is "one hundred six million, four hundred one thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •