Base | Representation |
---|---|
bin | 110001101010000111… |
… | …111000010110101001 |
3 | 12002121222002121101101 |
4 | 301222013320112221 |
5 | 1333144413331111 |
6 | 40254521521401 |
7 | 3565215005650 |
oct | 615207702651 |
9 | 162558077341 |
10 | 53320058281 |
11 | 20681867a76 |
12 | a400943261 |
13 | 5049855b59 |
14 | 281b64c197 |
15 | 15c10aabc1 |
hex | c6a1f85a9 |
53320058281 has 8 divisors (see below), whose sum is σ = 60983141120. Its totient is φ = 45668458368.
The previous prime is 53320058279. The next prime is 53320058293. The reversal of 53320058281 is 18285002335.
53320058281 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 53320058281 - 21 = 53320058279 is a prime.
It is a super-2 number, since 2×533200582812 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 53320058281.
It is not an unprimeable number, because it can be changed into a prime (53320058681) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2860776 + ... + 2879353.
It is an arithmetic number, because the mean of its divisors is an integer number (7622892640).
Almost surely, 253320058281 is an apocalyptic number.
It is an amenable number.
53320058281 is a deficient number, since it is larger than the sum of its proper divisors (7663082839).
53320058281 is a wasteful number, since it uses less digits than its factorization.
53320058281 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5741463.
The product of its (nonzero) digits is 57600, while the sum is 37.
The spelling of 53320058281 in words is "fifty-three billion, three hundred twenty million, fifty-eight thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •