Base | Representation |
---|---|
bin | 10000000010011000001011… |
… | …111000101101110110000011 |
3 | 100020201210210222011012110211 |
4 | 100002120023320231312003 |
5 | 33221044322000232011 |
6 | 410002005023134551 |
7 | 20566531326010351 |
oct | 2002301370556603 |
9 | 306653728135424 |
10 | 70532152352131 |
11 | 20523577262668 |
12 | 7ab172b144457 |
13 | 30481cc1075c2 |
14 | 135babacca7d1 |
15 | 824a831abb21 |
hex | 40260be2dd83 |
70532152352131 has 8 divisors (see below), whose sum is σ = 74245822091280. Its totient is φ = 66818627732448.
The previous prime is 70532152352119. The next prime is 70532152352149. The reversal of 70532152352131 is 13125325123507.
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 70532152352131 - 27 = 70532152352003 is a prime.
It is a super-2 number, since 2×705321523521312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (70532152352731) 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, 35281516 + ... + 37227001.
It is an arithmetic number, because the mean of its divisors is an integer number (9280727761410).
Almost surely, 270532152352131 is an apocalyptic number.
70532152352131 is a deficient number, since it is larger than the sum of its proper divisors (3713669739149).
70532152352131 is a wasteful number, since it uses less digits than its factorization.
70532152352131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72559733.
The product of its (nonzero) digits is 189000, while the sum is 40.
Adding to 70532152352131 its reverse (13125325123507), we get a palindrome (83657477475638).
The spelling of 70532152352131 in words is "seventy trillion, five hundred thirty-two billion, one hundred fifty-two million, three hundred fifty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •