Base | Representation |
---|---|
bin | 10000000100101100011… |
… | …11001100111011100001 |
3 | 1221210112002110001002221 |
4 | 20002112033030323201 |
5 | 33022030223201114 |
6 | 1101413503311041 |
7 | 54620631533524 |
oct | 10022617147341 |
9 | 1853462401087 |
10 | 552276381409 |
11 | 1a324568a5a5 |
12 | 8b0502ab481 |
13 | 401056b343c |
14 | 1ca31dd4bbb |
15 | e575281524 |
hex | 80963ccee1 |
552276381409 has 27 divisors (see below), whose sum is σ = 586166070483. Its totient is φ = 520302223584.
The previous prime is 552276381407. The next prime is 552276381421. The reversal of 552276381409 is 904183672255.
The square root of 552276381409 is 743153.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 504734939809 + 47541441600 = 710447^2 + 218040^2 .
It is not a de Polignac number, because 552276381409 - 21 = 552276381407 is a prime.
It is not an unprimeable number, because it can be changed into a prime (552276381401) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 1350308797 + ... + 1350309205.
It is a 1-persistent number, because it is pandigital, but 2⋅552276381409 = 1104552762818 is not.
Almost surely, 2552276381409 is an apocalyptic number.
552276381409 is the 743153-rd square number.
552276381409 is the 371577-th centered octagonal number.
It is an amenable number.
552276381409 is a deficient number, since it is larger than the sum of its proper divisors (33889689074).
552276381409 is an frugal number, since it uses more digits than its factorization.
552276381409 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1022 (or 511 counting only the distinct ones).
The product of its (nonzero) digits is 3628800, while the sum is 52.
The spelling of 552276381409 in words is "five hundred fifty-two billion, two hundred seventy-six million, three hundred eighty-one thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •