Base | Representation |
---|---|
bin | 10110110110100011100110… |
… | …011101000100010110010001 |
3 | 111011212021210222211112122112 |
4 | 112312203212131010112101 |
5 | 101133142443340343230 |
6 | 553431510533515105 |
7 | 30112216610440064 |
oct | 2666434635042621 |
9 | 434767728745575 |
10 | 100506101106065 |
11 | 2a02a441981996 |
12 | b332909aa2a95 |
13 | 44108b929c845 |
14 | 1ab67424428db |
15 | b945dad5cd95 |
hex | 5b68e6744591 |
100506101106065 has 4 divisors (see below), whose sum is σ = 120607321327284. Its totient is φ = 80404880884848.
The previous prime is 100506101105999. The next prime is 100506101106071. The reversal of 100506101106065 is 560601101605001.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 39834729298576 + 60671371807489 = 6311476^2 + 7789183^2 .
It is a cyclic number.
It is not a de Polignac number, because 100506101106065 - 228 = 100505832670609 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10050610110602 + ... + 10050610110611.
It is an arithmetic number, because the mean of its divisors is an integer number (30151830331821).
Almost surely, 2100506101106065 is an apocalyptic number.
It is an amenable number.
100506101106065 is a deficient number, since it is larger than the sum of its proper divisors (20101220221219).
100506101106065 is an equidigital number, since it uses as much as digits as its factorization.
100506101106065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20101220221218.
The product of its (nonzero) digits is 5400, while the sum is 32.
The spelling of 100506101106065 in words is "one hundred trillion, five hundred six billion, one hundred one million, one hundred six thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •