Base | Representation |
---|---|
bin | 100000111101001… |
… | …110100100011101 |
3 | 1102112102022112101 |
4 | 200331032210131 |
5 | 2113021440443 |
6 | 130511005101 |
7 | 16462516444 |
oct | 4075164435 |
9 | 1375368471 |
10 | 552921373 |
11 | 264123014 |
12 | 135209791 |
13 | 8a724114 |
14 | 5360dd5b |
15 | 3381d84d |
hex | 20f4e91d |
552921373 has 2 divisors, whose sum is σ = 552921374. Its totient is φ = 552921372.
The previous prime is 552921371. The next prime is 552921419. The reversal of 552921373 is 373129255.
552921373 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 can be written as a sum of positive squares in only one way, i.e., 507736089 + 45185284 = 22533^2 + 6722^2 .
It is a cyclic number.
It is not a de Polignac number, because 552921373 - 21 = 552921371 is a prime.
Together with 552921371, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (552921371) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 276460686 + 276460687.
It is an arithmetic number, because the mean of its divisors is an integer number (276460687).
Almost surely, 2552921373 is an apocalyptic number.
It is an amenable number.
552921373 is a deficient number, since it is larger than the sum of its proper divisors (1).
552921373 is an equidigital number, since it uses as much as digits as its factorization.
552921373 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 56700, while the sum is 37.
The square root of 552921373 is about 23514.2801931082. The cubic root of 552921373 is about 820.7693419109.
It can be divided in two parts, 55292 and 1373, that added together give a palindrome (56665).
The spelling of 552921373 in words is "five hundred fifty-two million, nine hundred twenty-one thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •