Base | Representation |
---|---|
bin | 111110000100010000110… |
… | …0110001111110011100001 |
3 | 1010012111101001201010222112 |
4 | 1330020201212033303201 |
5 | 2104230143343133233 |
6 | 30050444114245105 |
7 | 1540204326535241 |
oct | 174104146176341 |
9 | 33174331633875 |
10 | 8530368724193 |
11 | 27997888386a8 |
12 | b592ab286795 |
13 | 49b544617a04 |
14 | 216c2cc8db21 |
15 | ebd63c59048 |
hex | 7c22198fce1 |
8530368724193 has 2 divisors, whose sum is σ = 8530368724194. Its totient is φ = 8530368724192.
The previous prime is 8530368724153. The next prime is 8530368724349. The reversal of 8530368724193 is 3914278630358.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7925531213824 + 604837510369 = 2815232^2 + 777713^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-8530368724193 is a prime.
It is a super-2 number, since 2×85303687241932 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (8530368724103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4265184362096 + 4265184362097.
It is an arithmetic number, because the mean of its divisors is an integer number (4265184362097).
It is a 1-persistent number, because it is pandigital, but 2⋅8530368724193 = 17060737448386 is not.
Almost surely, 28530368724193 is an apocalyptic number.
It is an amenable number.
8530368724193 is a deficient number, since it is larger than the sum of its proper divisors (1).
8530368724193 is an equidigital number, since it uses as much as digits as its factorization.
8530368724193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26127360, while the sum is 59.
The spelling of 8530368724193 in words is "eight trillion, five hundred thirty billion, three hundred sixty-eight million, seven hundred twenty-four thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •