Base | Representation |
---|---|
bin | 11000100101100101… |
… | …00100000100101010 |
3 | 1021001221101221011100 |
4 | 30102302210010222 |
5 | 204013214143410 |
6 | 10021500542230 |
7 | 645053252541 |
oct | 142262440452 |
9 | 37057357140 |
10 | 13200146730 |
11 | 5664158681 |
12 | 2684851976 |
13 | 13249aaa14 |
14 | 8d3189158 |
15 | 523cd98c0 |
hex | 312ca412a |
13200146730 has 48 divisors (see below), whose sum is σ = 34418802600. Its totient is φ = 3509944704.
The previous prime is 13200146719. The next prime is 13200146731. The reversal of 13200146730 is 3764100231.
It can be written as a sum of positive squares in 4 ways, for example, as 11853330129 + 1346816601 = 108873^2 + 36699^2 .
It is a junction number, because it is equal to n+sod(n) for n = 13200146694 and 13200146703.
It is not an unprimeable number, because it can be changed into a prime (13200146731) 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, 178717 + ... + 241536.
Almost surely, 213200146730 is an apocalyptic number.
13200146730 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13200146730 is an abundant number, since it is smaller than the sum of its proper divisors (21218655870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13200146730 is a wasteful number, since it uses less digits than its factorization.
13200146730 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 420615 (or 420612 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 27.
Adding to 13200146730 its reverse (3764100231), we get a palindrome (16964246961).
The spelling of 13200146730 in words is "thirteen billion, two hundred million, one hundred forty-six thousand, seven hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •