Base | Representation |
---|---|
bin | 11010000111111011… |
… | …11001101101000101 |
3 | 1100012102220002220111 |
4 | 31003331321231011 |
5 | 212210422440001 |
6 | 10235412433021 |
7 | 1004362153132 |
oct | 150375715505 |
9 | 40172802814 |
10 | 14025202501 |
11 | 5a47952252 |
12 | 2875018771 |
13 | 14268c42bb |
14 | 970997589 |
15 | 571460851 |
hex | 343f79b45 |
14025202501 has 4 divisors (see below), whose sum is σ = 14083398604. Its totient is φ = 13967006400.
The previous prime is 14025202489. The next prime is 14025202519. The reversal of 14025202501 is 10520252041.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 10520252041 = 13 ⋅809250157.
It can be written as a sum of positive squares in 2 ways, for example, as 9118340100 + 4906862401 = 95490^2 + 70049^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14025202501 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 (14025202531) 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, 29097690 + ... + 29098171.
It is an arithmetic number, because the mean of its divisors is an integer number (3520849651).
Almost surely, 214025202501 is an apocalyptic number.
It is an amenable number.
14025202501 is a deficient number, since it is larger than the sum of its proper divisors (58196103).
14025202501 is an equidigital number, since it uses as much as digits as its factorization.
14025202501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 58196102.
The product of its (nonzero) digits is 800, while the sum is 22.
Adding to 14025202501 its reverse (10520252041), we get a palindrome (24545454542).
The spelling of 14025202501 in words is "fourteen billion, twenty-five million, two hundred two thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •