Base | Representation |
---|---|
bin | 10000000010101100000101… |
… | …101111000101011111011011 |
3 | 100020210211222101200102212120 |
4 | 100002230011233011133123 |
5 | 33221422104121010411 |
6 | 410015501431512323 |
7 | 20601216045015642 |
oct | 2002540557053733 |
9 | 306724871612776 |
10 | 70553524000731 |
11 | 20531643a76572 |
12 | 7ab58b45286a3 |
13 | 304a226a15215 |
14 | 135cb47424359 |
15 | 8253d456c106 |
hex | 402b05bc57db |
70553524000731 has 8 divisors (see below), whose sum is σ = 95360014174800. Its totient is φ = 46391358246912.
The previous prime is 70553524000717. The next prime is 70553524000741. The reversal of 70553524000731 is 13700042535507.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 70553524000731 - 26 = 70553524000667 is a prime.
It is a super-2 number, since 2×705535240007312 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (70553524000741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 161081104806 + ... + 161081105243.
It is an arithmetic number, because the mean of its divisors is an integer number (11920001771850).
Almost surely, 270553524000731 is an apocalyptic number.
70553524000731 is a deficient number, since it is larger than the sum of its proper divisors (24806490174069).
70553524000731 is a wasteful number, since it uses less digits than its factorization.
70553524000731 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 322162210125.
The product of its (nonzero) digits is 441000, while the sum is 42.
The spelling of 70553524000731 in words is "seventy trillion, five hundred fifty-three billion, five hundred twenty-four million, seven hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •