Base | Representation |
---|---|
bin | 10100101100111101001010… |
… | …10010011101110000001011 |
3 | 12222012011022200111212012121 |
4 | 22112132211102131300023 |
5 | 21431340432122421103 |
6 | 240453542350152111 |
7 | 12406040124354052 |
oct | 1226364522356013 |
9 | 188164280455177 |
10 | 45525131451403 |
11 | 1356211095947a |
12 | 51330aa4b2637 |
13 | 1c530033192a6 |
14 | b355dca89399 |
15 | 53e32e55c6bd |
hex | 2967a549dc0b |
45525131451403 has 2 divisors, whose sum is σ = 45525131451404. Its totient is φ = 45525131451402.
The previous prime is 45525131451391. The next prime is 45525131451511. The reversal of 45525131451403 is 30415413152554.
45525131451403 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 45525131451403 - 221 = 45525129354251 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 45525131451403.
It is not a weakly prime, because it can be changed into another prime (45525131452403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 22762565725701 + 22762565725702.
It is an arithmetic number, because the mean of its divisors is an integer number (22762565725702).
Almost surely, 245525131451403 is an apocalyptic number.
45525131451403 is a deficient number, since it is larger than the sum of its proper divisors (1).
45525131451403 is an equidigital number, since it uses as much as digits as its factorization.
45525131451403 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720000, while the sum is 43.
The spelling of 45525131451403 in words is "forty-five trillion, five hundred twenty-five billion, one hundred thirty-one million, four hundred fifty-one thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.276 sec. • engine limits •