Base | Representation |
---|---|
bin | 11001011011000101001110… |
… | …01101110000000001010001 |
3 | 21022221120102012202120120202 |
4 | 30231202213031300001101 |
5 | 24311431143012134434 |
6 | 314522524015344545 |
7 | 14530040160645626 |
oct | 1455424715600121 |
9 | 238846365676522 |
10 | 55906099724369 |
11 | 168a4709909664 |
12 | 632ab87822155 |
13 | 2526bcbbb72ab |
14 | db3c2650434d |
15 | 66e3a5143a7e |
hex | 32d8a7370051 |
55906099724369 has 2 divisors, whose sum is σ = 55906099724370. Its totient is φ = 55906099724368.
The previous prime is 55906099724317. The next prime is 55906099724393. The reversal of 55906099724369 is 96342799060955.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30566081395600 + 25340018328769 = 5528660^2 + 5033887^2 .
It is a cyclic number.
It is not a de Polignac number, because 55906099724369 - 28 = 55906099724113 is a prime.
It is a super-2 number, since 2×559060997243692 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 55906099724296 and 55906099724305.
It is not a weakly prime, because it can be changed into another prime (55906099724569) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27953049862184 + 27953049862185.
It is an arithmetic number, because the mean of its divisors is an integer number (27953049862185).
Almost surely, 255906099724369 is an apocalyptic number.
It is an amenable number.
55906099724369 is a deficient number, since it is larger than the sum of its proper divisors (1).
55906099724369 is an equidigital number, since it uses as much as digits as its factorization.
55906099724369 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 992023200, while the sum is 74.
The spelling of 55906099724369 in words is "fifty-five trillion, nine hundred six billion, ninety-nine million, seven hundred twenty-four thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •