Base | Representation |
---|---|
bin | 110001011000101001… |
… | …0100100101111010101 |
3 | 101010202001122200211022 |
4 | 1202301102210233111 |
5 | 3214144213321123 |
6 | 120415333450525 |
7 | 10443052106663 |
oct | 1426122445725 |
9 | 333661580738 |
10 | 106053651413 |
11 | 40a82580aa6 |
12 | 186791a0a45 |
13 | a001a418b8 |
14 | 51c1037c33 |
15 | 2b5a91e1c8 |
hex | 18b14a4bd5 |
106053651413 has 4 divisors (see below), whose sum is σ = 111635422560. Its totient is φ = 100471880268.
The previous prime is 106053651359. The next prime is 106053651421. The reversal of 106053651413 is 314156350601.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 314156350601 = 433 ⋅725534297.
It is a cyclic number.
It is not a de Polignac number, because 106053651413 - 210 = 106053650389 is a prime.
It is a super-2 number, since 2×1060536514132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106053651463) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2790885545 + ... + 2790885582.
It is an arithmetic number, because the mean of its divisors is an integer number (27908855640).
Almost surely, 2106053651413 is an apocalyptic number.
It is an amenable number.
106053651413 is a deficient number, since it is larger than the sum of its proper divisors (5581771147).
106053651413 is an equidigital number, since it uses as much as digits as its factorization.
106053651413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5581771146.
The product of its (nonzero) digits is 32400, while the sum is 35.
The spelling of 106053651413 in words is "one hundred six billion, fifty-three million, six hundred fifty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •