Base | Representation |
---|---|
bin | 11000001111000011… |
… | …10010100000001010 |
3 | 1020120202212102222200 |
4 | 30013201302200022 |
5 | 203121331400020 |
6 | 5551031101030 |
7 | 640300242504 |
oct | 140741624012 |
9 | 36522772880 |
10 | 13011200010 |
11 | 5577535166 |
12 | 2631511776 |
13 | 12c47c3823 |
14 | 8b6042d74 |
15 | 512415590 |
hex | 30787280a |
13011200010 has 48 divisors (see below), whose sum is σ = 34056196200. Its totient is φ = 3446363520.
The previous prime is 13011199939. The next prime is 13011200017. The reversal of 13011200010 is 1000211031.
It can be written as a sum of positive squares in 4 ways, for example, as 11910884769 + 1100315241 = 109137^2 + 33171^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 13011199965 and 13011200001.
It is not an unprimeable number, because it can be changed into a prime (13011200017) 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 23 ways as a sum of consecutive naturals, for example, 471721 + ... + 498540.
Almost surely, 213011200010 is an apocalyptic number.
13011200010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13011200010 is an abundant number, since it is smaller than the sum of its proper divisors (21044996190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13011200010 is a wasteful number, since it uses less digits than its factorization.
13011200010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 970423 (or 970420 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 13011200010 its reverse (1000211031), we get a palindrome (14011411041).
The spelling of 13011200010 in words is "thirteen billion, eleven million, two hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •