Base | Representation |
---|---|
bin | 110011100001010001… |
… | …011000111111010001 |
3 | 12021210021112101201121 |
4 | 303201101120333101 |
5 | 1401243133234303 |
6 | 41225131002241 |
7 | 3665600036602 |
oct | 634121307721 |
9 | 167707471647 |
10 | 55319039953 |
11 | 21508179541 |
12 | a87a299381 |
13 | 52a7a34848 |
14 | 296ad1dda9 |
15 | 168b81b9bd |
hex | ce1458fd1 |
55319039953 has 2 divisors, whose sum is σ = 55319039954. Its totient is φ = 55319039952.
The previous prime is 55319039917. The next prime is 55319040013. The reversal of 55319039953 is 35993091355.
55319039953 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., 28167580224 + 27151459729 = 167832^2 + 164777^2 .
It is a cyclic number.
It is not a de Polignac number, because 55319039953 - 29 = 55319039441 is a prime.
It is a super-2 number, since 2×553190399532 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 55319039953.
It is not a weakly prime, because it can be changed into another prime (55319039753) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27659519976 + 27659519977.
It is an arithmetic number, because the mean of its divisors is an integer number (27659519977).
Almost surely, 255319039953 is an apocalyptic number.
It is an amenable number.
55319039953 is a deficient number, since it is larger than the sum of its proper divisors (1).
55319039953 is an equidigital number, since it uses as much as digits as its factorization.
55319039953 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2460375, while the sum is 52.
The spelling of 55319039953 in words is "fifty-five billion, three hundred nineteen million, thirty-nine thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •