Search a number
-
+
161666052651010 = 2516166605265101
BaseRepresentation
bin100100110000100011001111…
…101000111111100000000010
3210012102010100011200212021001
4210300203033220333200002
5132142214033434313020
61331500205335322214
746023662331146425
oct4460431750774002
9705363304625231
10161666052651010
114756a208107046
121616bb69b2036a
136c2907431933b
142bcc9704c19bc
1513a548974250a
hex9308cfa3f802

161666052651010 has 8 divisors (see below), whose sum is σ = 290998894771836. Its totient is φ = 64666421060400.

The previous prime is 161666052650969. The next prime is 161666052651011. The reversal of 161666052651010 is 10156250666161.

It can be written as a sum of positive squares in 2 ways, for example, as 143117603933329 + 18548448717681 = 11963177^2 + 4306791^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

It is a super-2 number, since 2×1616660526510102 (a number of 29 digits) contains 22 as substring.

It is not an unprimeable number, because it can be changed into a prime (161666052651011) 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, 8083302632541 + ... + 8083302632560.

Almost surely, 2161666052651010 is an apocalyptic number.

161666052651010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

161666052651010 is a deficient number, since it is larger than the sum of its proper divisors (129332842120826).

161666052651010 is a wasteful number, since it uses less digits than its factorization.

161666052651010 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 16166605265108.

The product of its (nonzero) digits is 388800, while the sum is 46.

The spelling of 161666052651010 in words is "one hundred sixty-one trillion, six hundred sixty-six billion, fifty-two million, six hundred fifty-one thousand, ten".

Divisors: 1 2 5 10 16166605265101 32333210530202 80833026325505 161666052651010