Base | Representation |
---|---|
bin | 110001100111000001… |
… | …1100101001101000011 |
3 | 101011222200202202220221 |
4 | 1203032003211031003 |
5 | 3221141240313134 |
6 | 120535253443511 |
7 | 10461032162221 |
oct | 1431603451503 |
9 | 334880682827 |
10 | 106536260419 |
11 | 411aaa3a316 |
12 | 18792940597 |
13 | a07aa17c64 |
14 | 5229183b11 |
15 | 2b87e9e5b4 |
hex | 18ce0e5343 |
106536260419 has 4 divisors (see below), whose sum is σ = 112143432040. Its totient is φ = 100929088800.
The previous prime is 106536260417. The next prime is 106536260431. The reversal of 106536260419 is 914062635601.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 106536260419 - 21 = 106536260417 is a prime.
It is a super-2 number, since 2×1065362604192 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106536260417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2803585782 + ... + 2803585819.
It is an arithmetic number, because the mean of its divisors is an integer number (28035858010).
Almost surely, 2106536260419 is an apocalyptic number.
106536260419 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
106536260419 is a deficient number, since it is larger than the sum of its proper divisors (5607171621).
106536260419 is an equidigital number, since it uses as much as digits as its factorization.
106536260419 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5607171620.
The product of its (nonzero) digits is 233280, while the sum is 43.
The spelling of 106536260419 in words is "one hundred six billion, five hundred thirty-six million, two hundred sixty thousand, four hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •