Base | Representation |
---|---|
bin | 100000101111110110… |
… | …1000001001010111011 |
3 | 20201112002002220210111 |
4 | 1001133231001022323 |
5 | 2123011212113111 |
6 | 52150143125151 |
7 | 5036502413341 |
oct | 1013755011273 |
9 | 221462086714 |
10 | 70325113531 |
11 | 27908769742 |
12 | 117678a37b7 |
13 | 68298c921a |
14 | 3591c85991 |
15 | 1c68e30a21 |
hex | 105fb412bb |
70325113531 has 2 divisors, whose sum is σ = 70325113532. Its totient is φ = 70325113530.
The previous prime is 70325113499. The next prime is 70325113541. The reversal of 70325113531 is 13531152307.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (13531152307) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 70325113531 - 25 = 70325113499 is a prime.
It is a super-2 number, since 2×703251135312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 70325113493 and 70325113502.
It is not a weakly prime, because it can be changed into another prime (70325113541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 35162556765 + 35162556766.
It is an arithmetic number, because the mean of its divisors is an integer number (35162556766).
Almost surely, 270325113531 is an apocalyptic number.
70325113531 is a deficient number, since it is larger than the sum of its proper divisors (1).
70325113531 is an equidigital number, since it uses as much as digits as its factorization.
70325113531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9450, while the sum is 31.
Adding to 70325113531 its reverse (13531152307), we get a palindrome (83856265838).
The spelling of 70325113531 in words is "seventy billion, three hundred twenty-five million, one hundred thirteen thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •