Base | Representation |
---|---|
bin | 101110010000111… |
… | …1111101011010001 |
3 | 11000012010212122012 |
4 | 1130201333223101 |
5 | 11134404243231 |
6 | 414013352305 |
7 | 53320212353 |
oct | 13441775321 |
9 | 4005125565 |
10 | 1552415441 |
11 | 727330775 |
12 | 373a98695 |
13 | 1b9814c25 |
14 | 10a2690d3 |
15 | 9144ee2b |
hex | 5c87fad1 |
1552415441 has 2 divisors, whose sum is σ = 1552415442. Its totient is φ = 1552415440.
The previous prime is 1552415407. The next prime is 1552415471. The reversal of 1552415441 is 1445142551.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1451914816 + 100500625 = 38104^2 + 10025^2 .
It is a cyclic number.
It is not a de Polignac number, because 1552415441 - 230 = 478673617 is a prime.
It is a super-3 number, since 3×15524154413 (a number of 29 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1552415398 and 1552415407.
It is not a weakly prime, because it can be changed into another prime (1552415471) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 776207720 + 776207721.
It is an arithmetic number, because the mean of its divisors is an integer number (776207721).
Almost surely, 21552415441 is an apocalyptic number.
It is an amenable number.
1552415441 is a deficient number, since it is larger than the sum of its proper divisors (1).
1552415441 is an equidigital number, since it uses as much as digits as its factorization.
1552415441 is an evil number, because the sum of its binary digits is even.
The product of its digits is 16000, while the sum is 32.
The square root of 1552415441 is about 39400.7035597082. The cubic root of 1552415441 is about 1157.8953715314.
Adding to 1552415441 its reverse (1445142551), we get a palindrome (2997557992).
The spelling of 1552415441 in words is "one billion, five hundred fifty-two million, four hundred fifteen thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •