Base | Representation |
---|---|
bin | 11000101010111000111010… |
… | …01110010011100100111101 |
3 | 21010002021022021002000111011 |
4 | 30111130131032103210331 |
5 | 24102313423341031440 |
6 | 311214112533355221 |
7 | 14266310036163553 |
oct | 1425343516234475 |
9 | 233067267060434 |
10 | 54250222205245 |
11 | 16316432153000 |
12 | 6102081798b11 |
13 | 2436a0a63a991 |
14 | d57a20a7bbd3 |
15 | 64128d1c79ea |
hex | 31571d39393d |
54250222205245 has 32 divisors (see below), whose sum is σ = 75817484873856. Its totient is φ = 37133841859840.
The previous prime is 54250222205243. The next prime is 54250222205261.
54250222205245 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 54250222205245 - 21 = 54250222205243 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 54250222205198 and 54250222205207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54250222205243) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 239645659 + ... + 239871928.
It is an arithmetic number, because the mean of its divisors is an integer number (2369296402308).
Almost surely, 254250222205245 is an apocalyptic number.
54250222205245 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
54250222205245 is a deficient number, since it is larger than the sum of its proper divisors (21567262668611).
54250222205245 is a wasteful number, since it uses less digits than its factorization.
54250222205245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 479517642 (or 479517620 counting only the distinct ones).
The product of its (nonzero) digits is 640000, while the sum is 40.
The spelling of 54250222205245 in words is "fifty-four trillion, two hundred fifty billion, two hundred twenty-two million, two hundred five thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •