Search a number
-
+
10434450145 = 571717536891
BaseRepresentation
bin10011011011111000…
…10001001011100001
3222221012020222200111
421231330101023201
5132332204401040
64443222251321
7516401235310
oct115574211341
928835228614
1010434450145
114474a7a919
122032586b41
13ca3a01472
1470db34277
154110c8dea
hex26df112e1

10434450145 has 16 divisors (see below), whose sum is σ = 15151874688. Its totient is φ = 6734165760.

The previous prime is 10434450109. The next prime is 10434450149. The reversal of 10434450145 is 54105443401.

10434450145 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 10434450145 - 215 = 10434417377 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (10434450149) 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 15 ways as a sum of consecutive naturals, for example, 8767851 + ... + 8769040.

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

Almost surely, 210434450145 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 17536920.

The product of its (nonzero) digits is 19200, while the sum is 31.

Adding to 10434450145 its reverse (54105443401), we get a palindrome (64539893546).

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

Divisors: 1 5 7 17 35 85 119 595 17536891 87684455 122758237 298127147 613791185 1490635735 2086890029 10434450145