Base | Representation |
---|---|
bin | 10011100100001011… |
… | …10000001001010001 |
3 | 1000010001012210001210 |
4 | 21302011300021101 |
5 | 133003013421022 |
6 | 4454150050333 |
7 | 521204624205 |
oct | 116205601121 |
9 | 30101183053 |
10 | 10504045137 |
11 | 4500294643 |
12 | 20519499a9 |
13 | cb525a831 |
14 | 71908cb05 |
15 | 417274a0c |
hex | 272170251 |
10504045137 has 16 divisors (see below), whose sum is σ = 14491419840. Its totient is φ = 6759786432.
The previous prime is 10504045133. The next prime is 10504045141. The reversal of 10504045137 is 73154040501.
It is an interprime number because it is at equal distance from previous prime (10504045133) and next prime (10504045141).
It is not a de Polignac number, because 10504045137 - 22 = 10504045133 is a prime.
It is a super-3 number, since 3×105040451373 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (10504045133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 529398 + ... + 548880.
It is an arithmetic number, because the mean of its divisors is an integer number (905713740).
Almost surely, 210504045137 is an apocalyptic number.
It is an amenable number.
10504045137 is a deficient number, since it is larger than the sum of its proper divisors (3987374703).
10504045137 is a wasteful number, since it uses less digits than its factorization.
10504045137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25712.
The product of its (nonzero) digits is 8400, while the sum is 30.
Adding to 10504045137 its reverse (73154040501), we get a palindrome (83658085638).
The spelling of 10504045137 in words is "ten billion, five hundred four million, forty-five thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •