Base | Representation |
---|---|
bin | 110001100011000110… |
… | …0100000100100011001 |
3 | 101011122111121201010010 |
4 | 1203012030200210121 |
5 | 3220404010224001 |
6 | 120514223112133 |
7 | 10454541222030 |
oct | 1430614404431 |
9 | 334574551103 |
10 | 106404383001 |
11 | 41142555914 |
12 | 18756742649 |
13 | a0595c2a97 |
14 | 5215855717 |
15 | 2b7b5ee8d6 |
hex | 18c6320919 |
106404383001 has 64 divisors (see below), whose sum is σ = 173187072000. Its totient is φ = 56724796416.
The previous prime is 106404382999. The next prime is 106404383003. The reversal of 106404383001 is 100383404601.
It is an interprime number because it is at equal distance from previous prime (106404382999) and next prime (106404383003).
It is not a de Polignac number, because 106404383001 - 21 = 106404382999 is a prime.
It is a super-2 number, since 2×1064043830012 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106404383001.
It is not an unprimeable number, because it can be changed into a prime (106404383003) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 22169800 + ... + 22174598.
It is an arithmetic number, because the mean of its divisors is an integer number (2706048000).
Almost surely, 2106404383001 is an apocalyptic number.
It is an amenable number.
106404383001 is a deficient number, since it is larger than the sum of its proper divisors (66782688999).
106404383001 is a wasteful number, since it uses less digits than its factorization.
106404383001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5358.
The product of its (nonzero) digits is 6912, while the sum is 30.
Adding to 106404383001 its reverse (100383404601), we get a palindrome (206787787602).
The spelling of 106404383001 in words is "one hundred six billion, four hundred four million, three hundred eighty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •