Base | Representation |
---|---|
bin | 101010010101010010… |
… | …001010111000111101 |
3 | 11100022210011201001001 |
4 | 222111102022320331 |
5 | 1221042241210331 |
6 | 32514214050301 |
7 | 3166253451025 |
oct | 522522127075 |
9 | 140283151031 |
10 | 45454241341 |
11 | 18305809313 |
12 | 8986649991 |
13 | 43950644c2 |
14 | 22b2b12a85 |
15 | 12b0768561 |
hex | a9548ae3d |
45454241341 has 2 divisors, whose sum is σ = 45454241342. Its totient is φ = 45454241340.
The previous prime is 45454241323. The next prime is 45454241347. The reversal of 45454241341 is 14314245454.
45454241341 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 can be written as a sum of positive squares in only one way, i.e., 42499884025 + 2954357316 = 206155^2 + 54354^2 .
It is a cyclic number.
It is not a de Polignac number, because 45454241341 - 25 = 45454241309 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 45454241341.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (45454241347) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 22727120670 + 22727120671.
It is an arithmetic number, because the mean of its divisors is an integer number (22727120671).
Almost surely, 245454241341 is an apocalyptic number.
It is an amenable number.
45454241341 is a deficient number, since it is larger than the sum of its proper divisors (1).
45454241341 is an equidigital number, since it uses as much as digits as its factorization.
45454241341 is an evil number, because the sum of its binary digits is even.
The product of its digits is 153600, while the sum is 37.
Adding to 45454241341 its reverse (14314245454), we get a palindrome (59768486795).
The spelling of 45454241341 in words is "forty-five billion, four hundred fifty-four million, two hundred forty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •