Base | Representation |
---|---|
bin | 10011011001010110… |
… | …11001111110100001 |
3 | 222212201101001000000 |
4 | 21230223121332201 |
5 | 132311243040023 |
6 | 4441144050213 |
7 | 516023120526 |
oct | 115453317641 |
9 | 28781331000 |
10 | 10413252513 |
11 | 4464011814 |
12 | 2027463969 |
13 | c9c4bbba1 |
14 | 70adb714d |
15 | 40e2dd243 |
hex | 26cad9fa1 |
10413252513 has 28 divisors (see below), whose sum is σ = 15621002980. Its totient is φ = 6938493696.
The previous prime is 10413252511. The next prime is 10413252557. The reversal of 10413252513 is 31525231401.
10413252513 is a `hidden beast` number, since 1 + 0 + 4 + 132 + 525 + 1 + 3 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 3693843729 + 6719408784 = 60777^2 + 81972^2 .
It is not a de Polignac number, because 10413252513 - 21 = 10413252511 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10413252511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 2675673 + ... + 2679561.
Almost surely, 210413252513 is an apocalyptic number.
It is an amenable number.
10413252513 is a deficient number, since it is larger than the sum of its proper divisors (5207750467).
10413252513 is an frugal number, since it uses more digits than its factorization.
10413252513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7580 (or 7565 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
Adding to 10413252513 its reverse (31525231401), we get a palindrome (41938483914).
The spelling of 10413252513 in words is "ten billion, four hundred thirteen million, two hundred fifty-two thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •