Base | Representation |
---|---|
bin | 11000100000010001101010… |
… | …10011100001100100001001 |
3 | 21001210102000220112002212220 |
4 | 30100020311103201210021 |
5 | 24030330103311200111 |
6 | 310334403132324253 |
7 | 14231050155505044 |
oct | 1420106523414411 |
9 | 231712026462786 |
10 | 53885554006281 |
11 | 1619580a496778 |
12 | 606346b013689 |
13 | 240b502ba6aaa |
14 | d441090b5c5b |
15 | 636a48550e06 |
hex | 3102354e1909 |
53885554006281 has 8 divisors (see below), whose sum is σ = 71857393887840. Its totient is φ = 35918708397792.
The previous prime is 53885554006247. The next prime is 53885554006283. The reversal of 53885554006281 is 18260045558835.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 53885554006281 - 27 = 53885554006153 is a prime.
It is a super-2 number, since 2×538855540062812 (a number of 28 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (53885554006283) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1248543091 + ... + 1248586248.
It is an arithmetic number, because the mean of its divisors is an integer number (8982174235980).
Almost surely, 253885554006281 is an apocalyptic number.
It is an amenable number.
53885554006281 is a deficient number, since it is larger than the sum of its proper divisors (17971839881559).
53885554006281 is a wasteful number, since it uses less digits than its factorization.
53885554006281 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2497136535.
The product of its (nonzero) digits is 46080000, while the sum is 60.
The spelling of 53885554006281 in words is "fifty-three trillion, eight hundred eighty-five billion, five hundred fifty-four million, six thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •