Base | Representation |
---|---|
bin | 11000101010001010100111… |
… | …01100011100010000011000 |
3 | 21002222220011000020201201221 |
4 | 30111011103230130100120 |
5 | 24101412022231133000 |
6 | 311154442300421424 |
7 | 14264440061215141 |
oct | 1425052354342030 |
9 | 232886130221657 |
10 | 54225366271000 |
11 | 16306937675791 |
12 | 60b92a5547874 |
13 | 2434578c06292 |
14 | d567438b6ac8 |
15 | 6407d5eb161a |
hex | 315153b1c418 |
54225366271000 has 64 divisors (see below), whose sum is σ = 127544804974080. Its totient is φ = 21577762252800.
The previous prime is 54225366270991. The next prime is 54225366271001. The reversal of 54225366271000 is 17266352245.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54225366271001) 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 in 15 ways as a sum of consecutive naturals, for example, 140287224 + ... + 140673223.
It is an arithmetic number, because the mean of its divisors is an integer number (1992887577720).
Almost surely, 254225366271000 is an apocalyptic number.
54225366271000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
54225366271000 is an abundant number, since it is smaller than the sum of its proper divisors (73319438703080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54225366271000 is a wasteful number, since it uses less digits than its factorization.
54225366271000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280960661 (or 280960647 counting only the distinct ones).
The product of its (nonzero) digits is 604800, while the sum is 43.
The spelling of 54225366271000 in words is "fifty-four trillion, two hundred twenty-five billion, three hundred sixty-six million, two hundred seventy-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •