Base | Representation |
---|---|
bin | 101110010000111… |
… | …1100111101101011 |
3 | 11000012010022101201 |
4 | 1130201330331223 |
5 | 11134403414311 |
6 | 414013225031 |
7 | 53320135102 |
oct | 13441747553 |
9 | 4005108351 |
10 | 1552404331 |
11 | 727323395 |
12 | 373a92177 |
13 | 1b980cb5a |
14 | 10a265039 |
15 | 9144b9c1 |
hex | 5c87cf6b |
1552404331 has 2 divisors, whose sum is σ = 1552404332. Its totient is φ = 1552404330.
The previous prime is 1552404289. The next prime is 1552404353. The reversal of 1552404331 is 1334042551.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1552404331 - 29 = 1552403819 is a prime.
It is a super-3 number, since 3×15524043313 (a number of 29 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 1552404331.
It is not a weakly prime, because it can be changed into another prime (1553404331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 776202165 + 776202166.
It is an arithmetic number, because the mean of its divisors is an integer number (776202166).
Almost surely, 21552404331 is an apocalyptic number.
1552404331 is a deficient number, since it is larger than the sum of its proper divisors (1).
1552404331 is an equidigital number, since it uses as much as digits as its factorization.
1552404331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7200, while the sum is 28.
The square root of 1552404331 is about 39400.5625721258. The cubic root of 1552404331 is about 1157.8926093309.
Adding to 1552404331 its reverse (1334042551), we get a palindrome (2886446882).
The spelling of 1552404331 in words is "one billion, five hundred fifty-two million, four hundred four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •