Base | Representation |
---|---|
bin | 11000010000110100110011… |
… | …00111100110100101010101 |
3 | 20222220122201001202102212222 |
4 | 30020122121213212211111 |
5 | 23443130321211442423 |
6 | 305250443133552125 |
7 | 14144514145012523 |
oct | 1410323147464525 |
9 | 228818631672788 |
10 | 53354661046613 |
11 | 16000648231453 |
12 | 5b985a8045645 |
13 | 23a0427693c34 |
14 | d26545001313 |
15 | 627d257083c8 |
hex | 3086999e6955 |
53354661046613 has 4 divisors (see below), whose sum is σ = 53367495946380. Its totient is φ = 53341826146848.
The previous prime is 53354661046607. The next prime is 53354661046657. The reversal of 53354661046613 is 31664016645335.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 16642671088849 + 36711989957764 = 4079543^2 + 6059042^2 .
It is a cyclic number.
It is not a de Polignac number, because 53354661046613 - 24 = 53354661046597 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53354661046013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6417443648 + ... + 6417451961.
It is an arithmetic number, because the mean of its divisors is an integer number (13341873986595).
Almost surely, 253354661046613 is an apocalyptic number.
It is an amenable number.
53354661046613 is a deficient number, since it is larger than the sum of its proper divisors (12834899767).
53354661046613 is a wasteful number, since it uses less digits than its factorization.
53354661046613 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12834899766.
The product of its (nonzero) digits is 13996800, while the sum is 53.
The spelling of 53354661046613 in words is "fifty-three trillion, three hundred fifty-four billion, six hundred sixty-one million, forty-six thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •