Base | Representation |
---|---|
bin | 100110110000001… |
… | …0000000101100101 |
3 | 10100121202002110012 |
4 | 1031200100011211 |
5 | 10130334101013 |
6 | 333005540005 |
7 | 44136240326 |
oct | 11540200545 |
9 | 3317662405 |
10 | 1300300133 |
11 | 607a92810 |
12 | 303574605 |
13 | 179511782 |
14 | c499c44d |
15 | 7924e1a8 |
hex | 4d810165 |
1300300133 has 4 divisors (see below), whose sum is σ = 1418509248. Its totient is φ = 1182091020.
The previous prime is 1300300129. The next prime is 1300300151. The reversal of 1300300133 is 3310030031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 1300300133 - 22 = 1300300129 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1300300123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 59104541 + ... + 59104562.
It is an arithmetic number, because the mean of its divisors is an integer number (354627312).
Almost surely, 21300300133 is an apocalyptic number.
It is an amenable number.
1300300133 is a deficient number, since it is larger than the sum of its proper divisors (118209115).
1300300133 is a wasteful number, since it uses less digits than its factorization.
1300300133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118209114.
The product of its (nonzero) digits is 81, while the sum is 14.
The square root of 1300300133 is about 36059.6746102901. The cubic root of 1300300133 is about 1091.4768671163.
Adding to 1300300133 its reverse (3310030031), we get a palindrome (4610330164).
The spelling of 1300300133 in words is "one billion, three hundred million, three hundred thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •