Base | Representation |
---|---|
bin | 1101101000000010… |
… | …00100010111111001 |
3 | 200212210201221010222 |
4 | 12310001010113321 |
5 | 104440134134413 |
6 | 3205512545425 |
7 | 346163500643 |
oct | 66401042771 |
9 | 20783657128 |
10 | 7315146233 |
11 | 31142336aa |
12 | 15019b2275 |
13 | 8c76a7ac5 |
14 | 4d5753893 |
15 | 2cc31ab08 |
hex | 1b40445f9 |
7315146233 has 2 divisors, whose sum is σ = 7315146234. Its totient is φ = 7315146232.
The previous prime is 7315146143. The next prime is 7315146287. The reversal of 7315146233 is 3326415137.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7063225849 + 251920384 = 84043^2 + 15872^2 .
It is an emirp because it is prime and its reverse (3326415137) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 7315146233 - 214 = 7315129849 is a prime.
It is a super-2 number, since 2×73151462332 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 7315146193 and 7315146202.
It is not a weakly prime, because it can be changed into another prime (7315446233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3657573116 + 3657573117.
It is an arithmetic number, because the mean of its divisors is an integer number (3657573117).
Almost surely, 27315146233 is an apocalyptic number.
It is an amenable number.
7315146233 is a deficient number, since it is larger than the sum of its proper divisors (1).
7315146233 is an equidigital number, since it uses as much as digits as its factorization.
7315146233 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 45360, while the sum is 35.
The square root of 7315146233 is about 85528.6281487082. The cubic root of 7315146233 is about 1941.2181240766.
The spelling of 7315146233 in words is "seven billion, three hundred fifteen million, one hundred forty-six thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •