Base | Representation |
---|---|
bin | 11001000100111110000100… |
… | …10100011100111000000001 |
3 | 21020020221100121200120222111 |
4 | 30202133002110130320001 |
5 | 24212004203341120101 |
6 | 313141514204335321 |
7 | 14421122562341452 |
oct | 1442370224347001 |
9 | 236227317616874 |
10 | 55146345254401 |
11 | 16631485263295 |
12 | 6227893544541 |
13 | 24a037cb2911b |
14 | d891511c1129 |
15 | 65973a188251 |
hex | 3227c251ce01 |
55146345254401 has 2 divisors, whose sum is σ = 55146345254402. Its totient is φ = 55146345254400.
The previous prime is 55146345254353. The next prime is 55146345254453. The reversal of 55146345254401 is 10445254364155.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 34087194803776 + 21059150450625 = 5838424^2 + 4589025^2 .
It is a cyclic number.
It is not a de Polignac number, because 55146345254401 - 227 = 55146211036673 is a prime.
It is a super-2 number, since 2×551463452544012 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (55146345254491) 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, 27573172627200 + 27573172627201.
It is an arithmetic number, because the mean of its divisors is an integer number (27573172627201).
Almost surely, 255146345254401 is an apocalyptic number.
It is an amenable number.
55146345254401 is a deficient number, since it is larger than the sum of its proper divisors (1).
55146345254401 is an equidigital number, since it uses as much as digits as its factorization.
55146345254401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760000, while the sum is 49.
The spelling of 55146345254401 in words is "fifty-five trillion, one hundred forty-six billion, three hundred forty-five million, two hundred fifty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •