Base | Representation |
---|---|
bin | 1000011100111… |
… | …10111101110001 |
3 | 11221102101100112 |
4 | 10032132331301 |
5 | 121122440323 |
6 | 11011431105 |
7 | 1520455124 |
oct | 416367561 |
9 | 157371315 |
10 | 70905713 |
11 | 3702a56a |
12 | 1b8b5495 |
13 | 118c7b58 |
14 | 95ba3bb |
15 | 6359178 |
hex | 439ef71 |
70905713 has 2 divisors, whose sum is σ = 70905714. Its totient is φ = 70905712.
The previous prime is 70905683. The next prime is 70905719. The reversal of 70905713 is 31750907.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 69689104 + 1216609 = 8348^2 + 1103^2 .
It is an emirp because it is prime and its reverse (31750907) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 70905713 - 218 = 70643569 is a prime.
It is equal to p4168139 and since 70905713 and 4168139 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 70905713.
It is not a weakly prime, because it can be changed into another prime (70905719) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 35452856 + 35452857.
It is an arithmetic number, because the mean of its divisors is an integer number (35452857).
Almost surely, 270905713 is an apocalyptic number.
It is an amenable number.
70905713 is a deficient number, since it is larger than the sum of its proper divisors (1).
70905713 is an equidigital number, since it uses as much as digits as its factorization.
70905713 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6615, while the sum is 32.
The square root of 70905713 is about 8420.5530103432. The cubic root of 70905713 is about 413.8983954882.
The spelling of 70905713 in words is "seventy million, nine hundred five thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •