Base | Representation |
---|---|
bin | 110001010111001101… |
… | …0100110100011101001 |
3 | 101010121200220111202012 |
4 | 1202232122212203221 |
5 | 3214044342034421 |
6 | 120410452045305 |
7 | 10441625145224 |
oct | 1425632464351 |
9 | 333550814665 |
10 | 106005424361 |
11 | 40a58331331 |
12 | 18665003835 |
13 | 9cc4a57495 |
14 | 51b88825bb |
15 | 2b5659495b |
hex | 18ae6a68e9 |
106005424361 has 8 divisors (see below), whose sum is σ = 109465815360. Its totient is φ = 102590267472.
The previous prime is 106005424351. The next prime is 106005424363. The reversal of 106005424361 is 163424500601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 106005424361 - 218 = 106005162217 is a prime.
It is a super-2 number, since 2×1060054243612 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106005424363) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11303765 + ... + 11313138.
It is an arithmetic number, because the mean of its divisors is an integer number (13683226920).
Almost surely, 2106005424361 is an apocalyptic number.
It is an amenable number.
106005424361 is a deficient number, since it is larger than the sum of its proper divisors (3460390999).
106005424361 is a wasteful number, since it uses less digits than its factorization.
106005424361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22617055.
The product of its (nonzero) digits is 17280, while the sum is 32.
Adding to 106005424361 its reverse (163424500601), we get a palindrome (269429924962).
The spelling of 106005424361 in words is "one hundred six billion, five million, four hundred twenty-four thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •