Base | Representation |
---|---|
bin | 10100101011001101110000… |
… | …10111100101000000111011 |
3 | 12221222102221110111210002001 |
4 | 22111212320113211000323 |
5 | 21424400434414014302 |
6 | 240410251450321431 |
7 | 12401522030510506 |
oct | 1225467027450073 |
9 | 187872843453061 |
10 | 45465322016827 |
11 | 13539809aaaaa9 |
12 | 5123598429277 |
13 | 1c4a4911c200b |
14 | b3276764013d |
15 | 53c9cd8ed787 |
hex | 2959b85e503b |
45465322016827 has 2 divisors, whose sum is σ = 45465322016828. Its totient is φ = 45465322016826.
The previous prime is 45465322016761. The next prime is 45465322016921. The reversal of 45465322016827 is 72861022356454.
45465322016827 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 a de Polignac number, because none of the positive numbers 2k-45465322016827 is a prime.
It is a super-2 number, since 2×454653220168272 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (45465325016827) 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, 22732661008413 + 22732661008414.
It is an arithmetic number, because the mean of its divisors is an integer number (22732661008414).
Almost surely, 245465322016827 is an apocalyptic number.
45465322016827 is a deficient number, since it is larger than the sum of its proper divisors (1).
45465322016827 is an equidigital number, since it uses as much as digits as its factorization.
45465322016827 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19353600, while the sum is 55.
The spelling of 45465322016827 in words is "forty-five trillion, four hundred sixty-five billion, three hundred twenty-two million, sixteen thousand, eight hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •