Base | Representation |
---|---|
bin | 100000101111100011… |
… | …1111111100100111011 |
3 | 20201111101211210212100 |
4 | 1001133013333210323 |
5 | 2123001221021200 |
6 | 52145155114443 |
7 | 5036324050362 |
oct | 1013707774473 |
9 | 221441753770 |
10 | 70315407675 |
11 | 2790323a577 |
12 | 117645a2a23 |
13 | 68278ab506 |
14 | 359087a7d9 |
15 | 1c68164d00 |
hex | 105f1ff93b |
70315407675 has 18 divisors (see below), whose sum is σ = 125942708372. Its totient is φ = 37501550640.
The previous prime is 70315407671. The next prime is 70315407691. The reversal of 70315407675 is 57670451307.
70315407675 is a `hidden beast` number, since 7 + 0 + 31 + 540 + 7 + 6 + 75 = 666.
It is not a de Polignac number, because 70315407675 - 22 = 70315407671 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 70315407675.
It is not an unprimeable number, because it can be changed into a prime (70315407671) 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 17 ways as a sum of consecutive naturals, for example, 156256237 + ... + 156256686.
Almost surely, 270315407675 is an apocalyptic number.
70315407675 is a gapful number since it is divisible by the number (75) formed by its first and last digit.
70315407675 is a deficient number, since it is larger than the sum of its proper divisors (55627300697).
70315407675 is a wasteful number, since it uses less digits than its factorization.
70315407675 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 312512939 (or 312512931 counting only the distinct ones).
The product of its (nonzero) digits is 617400, while the sum is 45.
The spelling of 70315407675 in words is "seventy billion, three hundred fifteen million, four hundred seven thousand, six hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •