Search a number
-
+
10545460151 = 92831135997
BaseRepresentation
bin10011101001000111…
…01111001110110111
31000012221010212210012
421310203233032313
5133044114211101
64502225450435
7522216634532
oct116443571667
930187125705
1010545460151
114521701326
1220637a0a1b
13cc09cb465
1472078da19
1541ac05bbb
hex2748ef3b7

10545460151 has 4 divisors (see below), whose sum is σ = 10546605432. Its totient is φ = 10544314872.

The previous prime is 10545460139. The next prime is 10545460201. The reversal of 10545460151 is 15106454501.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 15106454501 = 37939858719.

It is a cyclic number.

It is not a de Polignac number, because 10545460151 - 26 = 10545460087 is a prime.

It is a super-2 number, since 2×105454601512 (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 (10545460951) 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, 558716 + ... + 577281.

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

Almost surely, 210545460151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1145280.

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

The spelling of 10545460151 in words is "ten billion, five hundred forty-five million, four hundred sixty thousand, one hundred fifty-one".

Divisors: 1 9283 1135997 10545460151