Base | Representation |
---|---|
bin | 110001010111010110… |
… | …1110100010010011101 |
3 | 101010122001101102012000 |
4 | 1202232231310102131 |
5 | 3214102134230331 |
6 | 120411152032513 |
7 | 10442016024261 |
oct | 1425655642235 |
9 | 333561342160 |
10 | 106010461341 |
11 | 40a60161724 |
12 | 18666832739 |
13 | 9cc5acc045 |
14 | 51b93d40a1 |
15 | 2b56c3c0e6 |
hex | 18aeb7449d |
106010461341 has 16 divisors (see below), whose sum is σ = 157065491520. Its totient is φ = 70667810640.
The previous prime is 106010461301. The next prime is 106010461367. The reversal of 106010461341 is 143164010601.
106010461341 is a `hidden beast` number, since 1 + 0 + 6 + 0 + 1 + 0 + 4 + 613 + 41 = 666.
It is not a de Polignac number, because 106010461341 - 217 = 106010330269 is a prime.
It is a super-2 number, since 2×1060104613412 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106010461301) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 184906 + ... + 496196.
It is an arithmetic number, because the mean of its divisors is an integer number (9816593220).
Almost surely, 2106010461341 is an apocalyptic number.
It is an amenable number.
106010461341 is a deficient number, since it is larger than the sum of its proper divisors (51055030179).
106010461341 is a wasteful number, since it uses less digits than its factorization.
106010461341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 323913 (or 323907 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
Adding to 106010461341 its reverse (143164010601), we get a palindrome (249174471942).
The spelling of 106010461341 in words is "one hundred six billion, ten million, four hundred sixty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •