Base | Representation |
---|---|
bin | 110001100000100111… |
… | …1100100110010111011 |
3 | 101011102201021200120122 |
4 | 1203001033210302323 |
5 | 3220221223110132 |
6 | 120502054243455 |
7 | 10452512100341 |
oct | 1430117446273 |
9 | 334381250518 |
10 | 106321300667 |
11 | 410aa66992a |
12 | 1873295658b |
13 | a04532373a |
14 | 52087c9991 |
15 | 2b7418c912 |
hex | 18c13e4cbb |
106321300667 has 4 divisors (see below), whose sum is σ = 106323470760. Its totient is φ = 106319130576.
The previous prime is 106321300661. The next prime is 106321300691. The reversal of 106321300667 is 766003123601.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 766003123601 = 109579 ⋅6990419.
It is a cyclic number.
It is not a de Polignac number, because 106321300667 - 28 = 106321300411 is a prime.
It is a super-2 number, since 2×1063213006672 (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 (106321300661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1009817 + ... + 1110122.
It is an arithmetic number, because the mean of its divisors is an integer number (26580867690).
Almost surely, 2106321300667 is an apocalyptic number.
106321300667 is a deficient number, since it is larger than the sum of its proper divisors (2170093).
106321300667 is an equidigital number, since it uses as much as digits as its factorization.
106321300667 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2170092.
The product of its (nonzero) digits is 27216, while the sum is 35.
The spelling of 106321300667 in words is "one hundred six billion, three hundred twenty-one million, three hundred thousand, six hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •