Base | Representation |
---|---|
bin | 110001011101110001… |
… | …0100110101110011101 |
3 | 101011012001020220121221 |
4 | 1202323202212232131 |
5 | 3220022230013023 |
6 | 120444355453341 |
7 | 10450240631443 |
oct | 1427342465635 |
9 | 334161226557 |
10 | 106225626013 |
11 | 41060662071 |
12 | 187068b7251 |
13 | a02b565910 |
14 | 51d9c02b93 |
15 | 2b6aa8e85d |
hex | 18bb8a6b9d |
106225626013 has 16 divisors (see below), whose sum is σ = 114808173760. Its totient is φ = 97702402176.
The previous prime is 106225625993. The next prime is 106225626047. The reversal of 106225626013 is 310626522601.
It is a cyclic number.
It is not a de Polignac number, because 106225626013 - 29 = 106225625501 is a prime.
It is a super-2 number, since 2×1062256260132 (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 106225626013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106225626413) 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, 4811506 + ... + 4833532.
It is an arithmetic number, because the mean of its divisors is an integer number (7175510860).
Almost surely, 2106225626013 is an apocalyptic number.
106225626013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
106225626013 is a deficient number, since it is larger than the sum of its proper divisors (8582547747).
106225626013 is a wasteful number, since it uses less digits than its factorization.
106225626013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23356.
The product of its (nonzero) digits is 25920, while the sum is 34.
The spelling of 106225626013 in words is "one hundred six billion, two hundred twenty-five million, six hundred twenty-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •