Base | Representation |
---|---|
bin | 100100100100000100001… |
… | …0010001000011010000011 |
3 | 122210102001100202221200100 |
4 | 1021020020102020122003 |
5 | 1124313203140111300 |
6 | 14404322430453443 |
7 | 1026030253142004 |
oct | 111101022103203 |
9 | 18712040687610 |
10 | 5025250707075 |
11 | 166821901a515 |
12 | 691b16364283 |
13 | 2a5b57529c61 |
14 | 13531b1511ab |
15 | 8aab9417700 |
hex | 49208488683 |
5025250707075 has 18 divisors (see below), whose sum is σ = 9000782377964. Its totient is φ = 2680133710320.
The previous prime is 5025250707067. The next prime is 5025250707079. The reversal of 5025250707075 is 5707070525205.
5025250707075 is a `hidden beast` number, since 5 + 0 + 2 + 5 + 2 + 507 + 0 + 70 + 75 = 666.
It is not a de Polignac number, because 5025250707075 - 23 = 5025250707067 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5025250707075.
It is not an unprimeable number, because it can be changed into a prime (5025250707079) 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 17 ways as a sum of consecutive naturals, for example, 11167223569 + ... + 11167224018.
Almost surely, 25025250707075 is an apocalyptic number.
5025250707075 is a deficient number, since it is larger than the sum of its proper divisors (3975531670889).
5025250707075 is a wasteful number, since it uses less digits than its factorization.
5025250707075 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22334447603 (or 22334447595 counting only the distinct ones).
The product of its (nonzero) digits is 857500, while the sum is 45.
The spelling of 5025250707075 in words is "five trillion, twenty-five billion, two hundred fifty million, seven hundred seven thousand, seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •