Base | Representation |
---|---|
bin | 110001011000010110… |
… | …1100011101100110011 |
3 | 101010201101101201000020 |
4 | 1202300231203230303 |
5 | 3214134222312302 |
6 | 120414345454523 |
7 | 10442603453436 |
oct | 1426055435463 |
9 | 333641351006 |
10 | 106043947827 |
11 | 40a78053604 |
12 | 18675aa1443 |
13 | 9ccca24c2c |
14 | 51bda2d81d |
15 | 2b59b53ebc |
hex | 18b0b63b33 |
106043947827 has 4 divisors (see below), whose sum is σ = 141391930440. Its totient is φ = 70695965216.
The previous prime is 106043947813. The next prime is 106043947837. The reversal of 106043947827 is 728749340601.
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 106043947827 - 27 = 106043947699 is a prime.
It is a super-2 number, since 2×1060439478272 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106043947827.
It is not an unprimeable number, because it can be changed into a prime (106043947837) 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, 17673991302 + ... + 17673991307.
It is an arithmetic number, because the mean of its divisors is an integer number (35347982610).
Almost surely, 2106043947827 is an apocalyptic number.
106043947827 is a deficient number, since it is larger than the sum of its proper divisors (35347982613).
106043947827 is an equidigital number, since it uses as much as digits as its factorization.
106043947827 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35347982612.
The product of its (nonzero) digits is 2032128, while the sum is 51.
The spelling of 106043947827 in words is "one hundred six billion, forty-three million, nine hundred forty-seven thousand, eight hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •