Base | Representation |
---|---|
bin | 110001010111011101… |
… | …0101100101011101101 |
3 | 101010122021201222011201 |
4 | 1202232322230223231 |
5 | 3214104020304221 |
6 | 120411352245501 |
7 | 10442056520035 |
oct | 1425672545355 |
9 | 333567658151 |
10 | 106013838061 |
11 | 40a620586aa |
12 | 186679a0891 |
13 | 9cc6711cc1 |
14 | 51b9a328c5 |
15 | 2b571a7891 |
hex | 18aeeacaed |
106013838061 has 32 divisors (see below), whose sum is σ = 113604042240. Its totient is φ = 98714880000.
The previous prime is 106013838019. The next prime is 106013838103. The reversal of 106013838061 is 160838310601.
It is an interprime number because it is at equal distance from previous prime (106013838019) and next prime (106013838103).
It is a cyclic number.
It is not a de Polignac number, because 106013838061 - 211 = 106013836013 is a prime.
It is a super-2 number, since 2×1060138380612 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 106013838061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106013838001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 68000400 + ... + 68001958.
It is an arithmetic number, because the mean of its divisors is an integer number (3550126320).
Almost surely, 2106013838061 is an apocalyptic number.
It is an amenable number.
106013838061 is a deficient number, since it is larger than the sum of its proper divisors (7590204179).
106013838061 is a wasteful number, since it uses less digits than its factorization.
106013838061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2157.
The product of its (nonzero) digits is 20736, while the sum is 37.
The spelling of 106013838061 in words is "one hundred six billion, thirteen million, eight hundred thirty-eight thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •