Base | Representation |
---|---|
bin | 10100101001111100001100… |
… | …10011000100111011000111 |
3 | 12221211020220200102211120221 |
4 | 22110332012103010323013 |
5 | 21423141244232144142 |
6 | 240334210333005211 |
7 | 12365411625211465 |
oct | 1224760623047307 |
9 | 187736820384527 |
10 | 45421532303047 |
11 | 135221889369aa |
12 | 5116bb7323807 |
13 | 1c46302c67284 |
14 | b305b1a1b835 |
15 | 53b7b937d767 |
hex | 294f864c4ec7 |
45421532303047 has 2 divisors, whose sum is σ = 45421532303048. Its totient is φ = 45421532303046.
The previous prime is 45421532302921. The next prime is 45421532303093. The reversal of 45421532303047 is 74030323512454.
45421532303047 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 45421532303047 - 211 = 45421532300999 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 45421532302994 and 45421532303012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (45421532304047) 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, 22710766151523 + 22710766151524.
It is an arithmetic number, because the mean of its divisors is an integer number (22710766151524).
Almost surely, 245421532303047 is an apocalyptic number.
45421532303047 is a deficient number, since it is larger than the sum of its proper divisors (1).
45421532303047 is an equidigital number, since it uses as much as digits as its factorization.
45421532303047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1209600, while the sum is 43.
The spelling of 45421532303047 in words is "forty-five trillion, four hundred twenty-one billion, five hundred thirty-two million, three hundred three thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •