Base | Representation |
---|---|
bin | 10000101111010010111… |
… | …111010110011011001001 |
3 | 11001222010010000212220111 |
4 | 100233102333112123021 |
5 | 122321301244342223 |
6 | 2240234433154321 |
7 | 146051260304236 |
oct | 20572277263311 |
9 | 4058103025814 |
10 | 1150296090313 |
11 | 403924178087 |
12 | 166b279bb9a1 |
13 | 8461aca7366 |
14 | 3d96327078d |
15 | 1edc633130d |
hex | 10bd2fd66c9 |
1150296090313 has 2 divisors, whose sum is σ = 1150296090314. Its totient is φ = 1150296090312.
The previous prime is 1150296090271. The next prime is 1150296090319. The reversal of 1150296090313 is 3130906920511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 954779128384 + 195516961929 = 977128^2 + 442173^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1150296090313 is a prime.
It is not a weakly prime, because it can be changed into another prime (1150296090319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 575148045156 + 575148045157.
It is an arithmetic number, because the mean of its divisors is an integer number (575148045157).
Almost surely, 21150296090313 is an apocalyptic number.
It is an amenable number.
1150296090313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1150296090313 is an equidigital number, since it uses as much as digits as its factorization.
1150296090313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43740, while the sum is 40.
The spelling of 1150296090313 in words is "one trillion, one hundred fifty billion, two hundred ninety-six million, ninety thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •