Base | Representation |
---|---|
bin | 1100101011110… |
… | …00111001110111 |
3 | 21102012202021120 |
4 | 12111320321313 |
5 | 204214321044 |
6 | 14320315023 |
7 | 2431253106 |
oct | 625707167 |
9 | 242182246 |
10 | 106401399 |
11 | 55073a45 |
12 | 2b772a73 |
13 | 19075410 |
14 | 101ba03d |
15 | 951b519 |
hex | 6578e77 |
106401399 has 8 divisors (see below), whose sum is σ = 152781552. Its totient is φ = 65477760.
The previous prime is 106401391. The next prime is 106401409. The reversal of 106401399 is 993104601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106401399 - 23 = 106401391 is a prime.
It is a super-2 number, since 2×1064013992 = 22642515418314402, which contains 22 as substring.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106401391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1364082 + ... + 1364159.
It is an arithmetic number, because the mean of its divisors is an integer number (19097694).
Almost surely, 2106401399 is an apocalyptic number.
106401399 is a deficient number, since it is larger than the sum of its proper divisors (46380153).
106401399 is a wasteful number, since it uses less digits than its factorization.
106401399 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2728257.
The product of its (nonzero) digits is 5832, while the sum is 33.
The square root of 106401399 is about 10315.1053799755. The cubic root of 106401399 is about 473.8589772575.
The spelling of 106401399 in words is "one hundred six million, four hundred one thousand, three hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •