Base | Representation |
---|---|
bin | 110001100001100000… |
… | …1010101111100010001 |
3 | 101011111210101212211110 |
4 | 1203003001111330101 |
5 | 3220301341433431 |
6 | 120505041403533 |
7 | 10453323432465 |
oct | 1430301257421 |
9 | 334453355743 |
10 | 106351124241 |
11 | 4111548980a |
12 | 187409395a9 |
13 | a04b56631b |
14 | 520c7504a5 |
15 | 2b76ace346 |
hex | 18c3055f11 |
106351124241 has 8 divisors (see below), whose sum is σ = 141883900704. Its totient is φ = 70859548640.
The previous prime is 106351124203. The next prime is 106351124273. The reversal of 106351124241 is 142421153601.
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 106351124241 - 218 = 106350862097 is a prime.
It is a super-2 number, since 2×1063511242412 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 106351124199 and 106351124208.
It is not an unprimeable number, because it can be changed into a prime (106351124741) 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, 10294191 + ... + 10304516.
It is an arithmetic number, because the mean of its divisors is an integer number (17735487588).
Almost surely, 2106351124241 is an apocalyptic number.
It is an amenable number.
106351124241 is a deficient number, since it is larger than the sum of its proper divisors (35532776463).
106351124241 is a wasteful number, since it uses less digits than its factorization.
106351124241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20600431.
The product of its (nonzero) digits is 5760, while the sum is 30.
Adding to 106351124241 its reverse (142421153601), we get a palindrome (248772277842).
The spelling of 106351124241 in words is "one hundred six billion, three hundred fifty-one million, one hundred twenty-four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •