Base | Representation |
---|---|
bin | 1001100011111010… |
… | …00000111000110101 |
3 | 111020201201201101221 |
4 | 10301331000320311 |
5 | 41003024422201 |
6 | 2205202550341 |
7 | 241126110436 |
oct | 46175007065 |
9 | 14221651357 |
10 | 5133045301 |
11 | 21a45199aa |
12 | bb30683b1 |
13 | 63a5a2517 |
14 | 369a1548d |
15 | 2009874a1 |
hex | 131f40e35 |
5133045301 has 4 divisors (see below), whose sum is σ = 5403205600. Its totient is φ = 4862885004.
The previous prime is 5133045299. The next prime is 5133045343. The reversal of 5133045301 is 1035403315.
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, and also an emirpimes, since its reverse is a distinct semiprime: 1035403315 = 5 ⋅207080663.
It is not a de Polignac number, because 5133045301 - 21 = 5133045299 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5133045361) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 135080121 + ... + 135080158.
It is an arithmetic number, because the mean of its divisors is an integer number (1350801400).
Almost surely, 25133045301 is an apocalyptic number.
It is an amenable number.
5133045301 is a deficient number, since it is larger than the sum of its proper divisors (270160299).
5133045301 is a wasteful number, since it uses less digits than its factorization.
5133045301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 270160298.
The product of its (nonzero) digits is 2700, while the sum is 25.
The square root of 5133045301 is about 71645.2741009482. The cubic root of 5133045301 is about 1725.0103256121.
Adding to 5133045301 its reverse (1035403315), we get a palindrome (6168448616).
The spelling of 5133045301 in words is "five billion, one hundred thirty-three million, forty-five thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •