Search a number
-
+
10154505371 is a prime number
BaseRepresentation
bin10010111010100000…
…10111010010011011
3222012200111022122112
421131100113102123
5131244023132441
64355342142535
7506431604633
oct113520272233
928180438575
1010154505371
114340a541aa
121b74881a4b
13c5aa05c7a
146c48a16c3
153e672c4eb
hex25d41749b

10154505371 has 2 divisors, whose sum is σ = 10154505372. Its totient is φ = 10154505370.

The previous prime is 10154505343. The next prime is 10154505379. The reversal of 10154505371 is 17350545101.

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

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10154505371 - 226 = 10087396507 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (10154505379) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5077252685 + 5077252686.

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

Almost surely, 210154505371 is an apocalyptic number.

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

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

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

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

The spelling of 10154505371 in words is "ten billion, one hundred fifty-four million, five hundred five thousand, three hundred seventy-one".