Search a number
-
+
10504955857 = 112432019019
BaseRepresentation
bin10011100100010010…
…01110011111010001
31000010002221001100011
421302021032133101
5133003232041412
64454221354521
7521215436314
oct116211163721
930102831304
1010504955857
114500856900
122052108a41
13cb54b9216
1471924897b
154173a47a7
hex27224e7d1

10504955857 has 12 divisors (see below), whose sum is σ = 11815305040. Its totient is φ = 9327863160.

The previous prime is 10504955837. The next prime is 10504955861. The reversal of 10504955857 is 75855940501.

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

It is not a de Polignac number, because 10504955857 - 215 = 10504923089 is a prime.

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

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

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

Almost surely, 210504955857 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2019084 (or 2019073 counting only the distinct ones).

The product of its (nonzero) digits is 1260000, while the sum is 49.

The spelling of 10504955857 in words is "ten billion, five hundred four million, nine hundred fifty-five thousand, eight hundred fifty-seven".

Divisors: 1 11 43 121 473 5203 2019019 22209209 86817817 244301299 954995987 10504955857