Base | Representation |
---|---|
bin | 10110110000001001110010… |
… | …010100111110111100111001 |
3 | 111010022020000012110110210111 |
4 | 112300021302110332330321 |
5 | 101103440300414244221 |
6 | 552453414405544321 |
7 | 30035351255241646 |
oct | 2660116224767471 |
9 | 433266005413714 |
10 | 100066066165561 |
11 | 2997a8646a7201 |
12 | b2815831150a1 |
13 | 43ab2605972c2 |
14 | 1a9d31b1b8dcd |
15 | b87e34879be1 |
hex | 5b027253ef39 |
100066066165561 has 4 divisors (see below), whose sum is σ = 103516620171300. Its totient is φ = 96615512159824.
The previous prime is 100066066165547. The next prime is 100066066165577. The reversal of 100066066165561 is 165561660660001.
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 46654364160000 + 53411702005561 = 6830400^2 + 7308331^2 .
It is a cyclic number.
It is not a de Polignac number, because 100066066165561 - 215 = 100066066132793 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100066066165591) 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, 1725277002826 + ... + 1725277002883.
It is an arithmetic number, because the mean of its divisors is an integer number (25879155042825).
Almost surely, 2100066066165561 is an apocalyptic number.
It is an amenable number.
100066066165561 is a deficient number, since it is larger than the sum of its proper divisors (3450554005739).
100066066165561 is an equidigital number, since it uses as much as digits as its factorization.
100066066165561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3450554005738.
The product of its (nonzero) digits is 1166400, while the sum is 49.
The spelling of 100066066165561 in words is "one hundred trillion, sixty-six billion, sixty-six million, one hundred sixty-five thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •