Base | Representation |
---|---|
bin | 100000110101111111… |
… | …0101100101110111000 |
3 | 20202001102122211211001 |
4 | 1001223332230232320 |
5 | 2123421423400000 |
6 | 52222421414344 |
7 | 5044553150161 |
oct | 1015376545670 |
9 | 222042584731 |
10 | 70531075000 |
11 | 27a03a53631 |
12 | 1180486a3b4 |
13 | 686048cb09 |
14 | 35b137a768 |
15 | 1c7c06646a |
hex | 106bfacbb8 |
70531075000 has 96 divisors (see below), whose sum is σ = 168418595520. Its totient is φ = 27679600000.
The previous prime is 70531074967. The next prime is 70531075007. The reversal of 70531075000 is 57013507.
It is a self number, because there is not a number n which added to its sum of digits gives 70531075000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (70531075007) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1298385 + ... + 1351615.
It is an arithmetic number, because the mean of its divisors is an integer number (1754360370).
Almost surely, 270531075000 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 70531075000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (84209297760).
70531075000 is an abundant number, since it is smaller than the sum of its proper divisors (97887520520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70531075000 is an equidigital number, since it uses as much as digits as its factorization.
70531075000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53315 (or 53291 counting only the distinct ones).
The product of its (nonzero) digits is 3675, while the sum is 28.
Adding to 70531075000 its reverse (57013507), we get a palindrome (70588088507).
The spelling of 70531075000 in words is "seventy billion, five hundred thirty-one million, seventy-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •