Base | Representation |
---|---|
bin | 10011100110001111… |
… | …01100011100111001 |
3 | 1000011020202000111221 |
4 | 21303013230130321 |
5 | 133021430102023 |
6 | 4500004352041 |
7 | 521504561620 |
oct | 116307543471 |
9 | 30136660457 |
10 | 10521331513 |
11 | 450a021100 |
12 | 20576a5621 |
13 | cb8a00a64 |
14 | 71b4ac6b7 |
15 | 418a3b85d |
hex | 2731ec739 |
10521331513 has 24 divisors (see below), whose sum is σ = 13224856064. Its totient is φ = 8193493440.
The previous prime is 10521331511. The next prime is 10521331519. The reversal of 10521331513 is 31513312501.
It is not a de Polignac number, because 10521331513 - 21 = 10521331511 is a prime.
It is a super-2 number, since 2×105213315132 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10521331511) 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 23 ways as a sum of consecutive naturals, for example, 2092120 + ... + 2097142.
Almost surely, 210521331513 is an apocalyptic number.
It is an amenable number.
10521331513 is a deficient number, since it is larger than the sum of its proper divisors (2703524551).
10521331513 is a wasteful number, since it uses less digits than its factorization.
10521331513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7525 (or 7514 counting only the distinct ones).
The product of its (nonzero) digits is 1350, while the sum is 25.
The spelling of 10521331513 in words is "ten billion, five hundred twenty-one million, three hundred thirty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •