Base | Representation |
---|---|
bin | 110001011011000100… |
… | …1101101101110100101 |
3 | 101010221202010120001101 |
4 | 1202312021231232211 |
5 | 3214331103340023 |
6 | 120431410000101 |
7 | 10445062304512 |
oct | 1426611555645 |
9 | 333852116041 |
10 | 106135215013 |
11 | 4101461aa33 |
12 | 186a0576031 |
13 | a0158cb899 |
14 | 51cbbca309 |
15 | 2b62b811ad |
hex | 18b626dba5 |
106135215013 has 8 divisors (see below), whose sum is σ = 107200862496. Its totient is φ = 105069858000.
The previous prime is 106135215007. The next prime is 106135215023. The reversal of 106135215013 is 310512531601.
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 106135215013 - 25 = 106135214981 is a prime.
It is a super-3 number, since 3×1061352150133 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106135215023) 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, 703198 + ... + 840688.
It is an arithmetic number, because the mean of its divisors is an integer number (13400107812).
Almost surely, 2106135215013 is an apocalyptic number.
It is an amenable number.
106135215013 is a deficient number, since it is larger than the sum of its proper divisors (1065647483).
106135215013 is a wasteful number, since it uses less digits than its factorization.
106135215013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 145235.
The product of its (nonzero) digits is 2700, while the sum is 28.
Adding to 106135215013 its reverse (310512531601), we get a palindrome (416647746614).
The spelling of 106135215013 in words is "one hundred six billion, one hundred thirty-five million, two hundred fifteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •