Search a number
-
+
10161457151 = 431491585993
BaseRepresentation
bin10010111011010101…
…11000011111111111
3222020011120111200212
421131222320133333
5131302313112101
64400151143035
7506544650336
oct113552703777
928204514625
1010161457151
11434497217a
121b77074a7b
13c5c29b251
146c5790d1d
153e71521bb
hex25dab87ff

10161457151 has 8 divisors (see below), whose sum is σ = 10467560400. Its totient is φ = 9858526272.

The previous prime is 10161457121. The next prime is 10161457153. The reversal of 10161457151 is 15175416101.

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

It is a cyclic number.

It is not a de Polignac number, because 10161457151 - 210 = 10161456127 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10161457153) by changing a digit.

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 7 ways as a sum of consecutive naturals, for example, 786590 + ... + 799403.

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

Almost surely, 210161457151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1586185.

The product of its (nonzero) digits is 4200, while the sum is 32.

The spelling of 10161457151 in words is "ten billion, one hundred sixty-one million, four hundred fifty-seven thousand, one hundred fifty-one".

Divisors: 1 43 149 6407 1585993 68197699 236312957 10161457151