Base | Representation |
---|---|
bin | 11111001001001101000… |
… | …11011001000000001001 |
3 | 10210022002200000201012012 |
4 | 33210212203121000021 |
5 | 120013022434341421 |
6 | 2135332205025305 |
7 | 140211630050204 |
oct | 17444643310011 |
9 | 3708080021165 |
10 | 1070093668361 |
11 | 382907a84433 |
12 | 153484255235 |
13 | 79ba8c4aa53 |
14 | 39b1568293b |
15 | 1cc801ca95b |
hex | f9268d9009 |
1070093668361 has 2 divisors, whose sum is σ = 1070093668362. Its totient is φ = 1070093668360.
The previous prime is 1070093668337. The next prime is 1070093668373. The reversal of 1070093668361 is 1638663900701.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 932615118400 + 137478549961 = 965720^2 + 370781^2 .
It is a cyclic number.
It is not a de Polignac number, because 1070093668361 - 222 = 1070089474057 is a prime.
It is a super-2 number, since 2×10700936683612 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1070093668331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 535046834180 + 535046834181.
It is an arithmetic number, because the mean of its divisors is an integer number (535046834181).
Almost surely, 21070093668361 is an apocalyptic number.
It is an amenable number.
1070093668361 is a deficient number, since it is larger than the sum of its proper divisors (1).
1070093668361 is an equidigital number, since it uses as much as digits as its factorization.
1070093668361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 979776, while the sum is 50.
The spelling of 1070093668361 in words is "one trillion, seventy billion, ninety-three million, six hundred sixty-eight thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •