Base | Representation |
---|---|
bin | 11111110101100011110010… |
… | …10000100100000111000011 |
3 | 100011212220001100211222002221 |
4 | 33322301321100210013003 |
5 | 33134020440313411042 |
6 | 404522052310151511 |
7 | 20514025045252453 |
oct | 1772617120440703 |
9 | 304786040758087 |
10 | 70010001310147 |
11 | 203420906454a8 |
12 | 7a284a7952597 |
13 | 300abb7a625c2 |
14 | 1340705c49d63 |
15 | 8161c2a61d67 |
hex | 3fac794241c3 |
70010001310147 has 8 divisors (see below), whose sum is σ = 72271159992320. Its totient is φ = 67749015849480.
The previous prime is 70010001310129. The next prime is 70010001310199. The reversal of 70010001310147 is 74101310001007.
70010001310147 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 70010001310147 - 227 = 70009867092419 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (70010001310547) 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, 42483747 + ... + 44100892.
It is an arithmetic number, because the mean of its divisors is an integer number (9033894999040).
Almost surely, 270010001310147 is an apocalyptic number.
70010001310147 is a deficient number, since it is larger than the sum of its proper divisors (2261158682173).
70010001310147 is a wasteful number, since it uses less digits than its factorization.
70010001310147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86610753.
The product of its (nonzero) digits is 588, while the sum is 25.
The spelling of 70010001310147 in words is "seventy trillion, ten billion, one million, three hundred ten thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •