Base | Representation |
---|---|
bin | 100000100111110000… |
… | …0000010011111000101 |
3 | 20200211010121010020120 |
4 | 1001033200002133011 |
5 | 2121432114304324 |
6 | 52103152452153 |
7 | 5026662006033 |
oct | 1011740023705 |
9 | 220733533216 |
10 | 70053275589 |
11 | 2778927a890 |
12 | 116b084a059 |
13 | 67b54ab97b |
14 | 3567b23553 |
15 | 1c50136179 |
hex | 104f8027c5 |
70053275589 has 16 divisors (see below), whose sum is σ = 107889537600. Its totient is φ = 39959087360.
The previous prime is 70053275587. The next prime is 70053275641. The reversal of 70053275589 is 98557235007.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 70053275589 - 21 = 70053275587 is a prime.
It is a super-2 number, since 2×700532755892 (a number of 22 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (70053275587) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 62435514 + ... + 62436635.
It is an arithmetic number, because the mean of its divisors is an integer number (6743096100).
Almost surely, 270053275589 is an apocalyptic number.
It is an amenable number.
70053275589 is a deficient number, since it is larger than the sum of its proper divisors (37836262011).
70053275589 is a wasteful number, since it uses less digits than its factorization.
70053275589 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124872180.
The product of its (nonzero) digits is 2646000, while the sum is 51.
The spelling of 70053275589 in words is "seventy billion, fifty-three million, two hundred seventy-five thousand, five hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •