Base | Representation |
---|---|
bin | 100110101111110… |
… | …0001101101111001 |
3 | 10100121101102220200 |
4 | 1031133201231321 |
5 | 10130312011301 |
6 | 333001512413 |
7 | 44134516515 |
oct | 11537415571 |
9 | 3317342820 |
10 | 1300110201 |
11 | 607973045 |
12 | 3034a2709 |
13 | 1794761a0 |
14 | c494d145 |
15 | 79212c86 |
hex | 4d7e1b79 |
1300110201 has 24 divisors (see below), whose sum is σ = 2024849736. Its totient is φ = 799096320.
The previous prime is 1300110191. The next prime is 1300110233. The reversal of 1300110201 is 1020110031.
It can be written as a sum of positive squares in 4 ways, for example, as 435600 + 1299674601 = 660^2 + 36051^2 .
It is not a de Polignac number, because 1300110201 - 29 = 1300109689 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (1300110001) 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, 96771 + ... + 109383.
It is an arithmetic number, because the mean of its divisors is an integer number (84368739).
Almost surely, 21300110201 is an apocalyptic number.
It is an amenable number.
1300110201 is a deficient number, since it is larger than the sum of its proper divisors (724739535).
1300110201 is a wasteful number, since it uses less digits than its factorization.
1300110201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13513 (or 13510 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 1300110201 is about 36057.0409351627. The cubic root of 1300110201 is about 1091.4237213146.
Adding to 1300110201 its reverse (1020110031), we get a palindrome (2320220232).
The spelling of 1300110201 in words is "one billion, three hundred million, one hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •