Search a number
-
+
161114999990 = 2572301642857
BaseRepresentation
bin1001011000001100110…
…0111100110010110110
3120101212101022000102212
42112003030330302312
510114430414444430
6202003141333422
714432402622020
oct2260314746266
9511771260385
10161114999990
116236824315a
1227285107272
131226826cc29
147b25a39010
1542ce7d7b95
hex258333ccb6

161114999990 has 16 divisors (see below), whose sum is σ = 331436571552. Its totient is φ = 55239428544.

The previous prime is 161114999971. The next prime is 161114999999. The reversal of 161114999990 is 99999411161.

161114999990 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.

It is a Curzon number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (161114999999) 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 7 ways as a sum of consecutive naturals, for example, 1150821359 + ... + 1150821498.

It is an arithmetic number, because the mean of its divisors is an integer number (20714785722).

Almost surely, 2161114999990 is an apocalyptic number.

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

161114999990 is an abundant number, since it is smaller than the sum of its proper divisors (170321571562).

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

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

The sum of its prime factors is 2301642871.

The product of its (nonzero) digits is 1417176, while the sum is 59.

The spelling of 161114999990 in words is "one hundred sixty-one billion, one hundred fourteen million, nine hundred ninety-nine thousand, nine hundred ninety".

Divisors: 1 2 5 7 10 14 35 70 2301642857 4603285714 11508214285 16111499999 23016428570 32222999998 80557499995 161114999990