Search a number
-
+
10151147657 = 71450163951
BaseRepresentation
bin10010111010000111…
…00011100010001001
3222012110011201201202
421131003203202021
5131242143211112
64355142153545
7506361221450
oct113503434211
928173151652
1010151147657
11433a070532
121b737228b5
13c5a0cb861
146c4269b97
153e62b76c2
hex25d0e3889

10151147657 has 4 divisors (see below), whose sum is σ = 11601311616. Its totient is φ = 8700983700.

The previous prime is 10151147639. The next prime is 10151147659. The reversal of 10151147657 is 75674115101.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-10151147657 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 10151147657.

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

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

Almost surely, 210151147657 is an apocalyptic number.

It is an amenable number.

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

10151147657 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 1450163958.

The product of its (nonzero) digits is 29400, while the sum is 38.

The spelling of 10151147657 in words is "ten billion, one hundred fifty-one million, one hundred forty-seven thousand, six hundred fifty-seven".

Divisors: 1 7 1450163951 10151147657