Base | Representation |
---|---|
bin | 110001011010011000… |
… | …1001111010000001001 |
3 | 101010220010111012112212 |
4 | 1202310301033100021 |
5 | 3214304134142023 |
6 | 120425220514505 |
7 | 10444361205131 |
oct | 1426461172011 |
9 | 333803435485 |
10 | 106112021513 |
11 | 41002519353 |
12 | 1869484ba35 |
13 | a010b6aa14 |
14 | 51c8aadac1 |
15 | 2b60aede78 |
hex | 18b4c4f409 |
106112021513 has 4 divisors (see below), whose sum is σ = 106112685588. Its totient is φ = 106111357440.
The previous prime is 106112021377. The next prime is 106112021527. The reversal of 106112021513 is 315120211601.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 34264971664 + 71847049849 = 185108^2 + 268043^2 .
It is a cyclic number.
It is not a de Polignac number, because 106112021513 - 232 = 101817054217 is a prime.
It is a super-2 number, since 2×1061120215132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (106112020513) 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, 69545 + ... + 465897.
It is an arithmetic number, because the mean of its divisors is an integer number (26528171397).
Almost surely, 2106112021513 is an apocalyptic number.
It is an amenable number.
106112021513 is a deficient number, since it is larger than the sum of its proper divisors (664075).
106112021513 is an equidigital number, since it uses as much as digits as its factorization.
106112021513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 664074.
The product of its (nonzero) digits is 360, while the sum is 23.
The spelling of 106112021513 in words is "one hundred six billion, one hundred twelve million, twenty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •