Base | Representation |
---|---|
bin | 1101100111000001… |
… | …10000001111000101 |
3 | 200212012210112222211 |
4 | 12303200300033011 |
5 | 104431002101031 |
6 | 3205011223421 |
7 | 346031466613 |
oct | 66340601705 |
9 | 20765715884 |
10 | 7306675141 |
11 | 310a4781a7 |
12 | 14baba7b71 |
13 | 8c5a0011c |
14 | 4d458a6b3 |
15 | 2cb6e5bb1 |
hex | 1b38303c5 |
7306675141 has 2 divisors, whose sum is σ = 7306675142. Its totient is φ = 7306675140.
The previous prime is 7306675139. The next prime is 7306675217. The reversal of 7306675141 is 1415766037.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5788014241 + 1518660900 = 76079^2 + 38970^2 .
It is a cyclic number.
It is not a de Polignac number, because 7306675141 - 21 = 7306675139 is a prime.
It is a super-2 number, since 2×73066751412 (a number of 21 digits) contains 22 as substring.
Together with 7306675139, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 7306675094 and 7306675103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (7306675741) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3653337570 + 3653337571.
It is an arithmetic number, because the mean of its divisors is an integer number (3653337571).
Almost surely, 27306675141 is an apocalyptic number.
It is an amenable number.
7306675141 is a deficient number, since it is larger than the sum of its proper divisors (1).
7306675141 is an equidigital number, since it uses as much as digits as its factorization.
7306675141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 105840, while the sum is 40.
The square root of 7306675141 is about 85479.0918353722. The cubic root of 7306675141 is about 1940.4685109463.
The spelling of 7306675141 in words is "seven billion, three hundred six million, six hundred seventy-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •