Base | Representation |
---|---|
bin | 11000101010000101010010… |
… | …01101100100011111010001 |
3 | 21002222121202200020112020202 |
4 | 30111002221031210133101 |
5 | 24101340143022122122 |
6 | 311153250404144545 |
7 | 14264306150566655 |
oct | 1425025115443721 |
9 | 232877680215222 |
10 | 54222506051537 |
11 | 163056aa0a754a |
12 | 60b8827698155 |
13 | 2434211483225 |
14 | d56551a98a65 |
15 | 6406b9d2de92 |
hex | 3150a93647d1 |
54222506051537 has 2 divisors, whose sum is σ = 54222506051538. Its totient is φ = 54222506051536.
The previous prime is 54222506051521. The next prime is 54222506051557. The reversal of 54222506051537 is 73515060522245.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 53278919176081 + 943586875456 = 7299241^2 + 971384^2 .
It is a cyclic number.
It is not a de Polignac number, because 54222506051537 - 24 = 54222506051521 is a prime.
It is a super-2 number, since 2×542225060515372 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 54222506051491 and 54222506051500.
It is not a weakly prime, because it can be changed into another prime (54222506051557) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27111253025768 + 27111253025769.
It is an arithmetic number, because the mean of its divisors is an integer number (27111253025769).
Almost surely, 254222506051537 is an apocalyptic number.
It is an amenable number.
54222506051537 is a deficient number, since it is larger than the sum of its proper divisors (1).
54222506051537 is an equidigital number, since it uses as much as digits as its factorization.
54222506051537 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520000, while the sum is 47.
The spelling of 54222506051537 in words is "fifty-four trillion, two hundred twenty-two billion, five hundred six million, fifty-one thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •