Base | Representation |
---|---|
bin | 11110100100000011111… |
… | …10010111111111111001 |
3 | 10201101121221110010021112 |
4 | 33102001332113333321 |
5 | 114201203033213223 |
6 | 2122233343250105 |
7 | 135604522043651 |
oct | 17220176277771 |
9 | 3641557403245 |
10 | 1050152632313 |
11 | 375404868954 |
12 | 14b639ba9935 |
13 | 7804b849635 |
14 | 38b83149361 |
15 | 1c4b470a778 |
hex | f481f97ff9 |
1050152632313 has 2 divisors, whose sum is σ = 1050152632314. Its totient is φ = 1050152632312.
The previous prime is 1050152632307. The next prime is 1050152632327. The reversal of 1050152632313 is 3132362510501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 695369196544 + 354783435769 = 833888^2 + 595637^2 .
It is a cyclic number.
It is not a de Polignac number, because 1050152632313 - 28 = 1050152632057 is a prime.
It is a super-2 number, since 2×10501526323132 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1050152632313.
It is not a weakly prime, because it can be changed into another prime (1050152632393) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 525076316156 + 525076316157.
It is an arithmetic number, because the mean of its divisors is an integer number (525076316157).
Almost surely, 21050152632313 is an apocalyptic number.
It is an amenable number.
1050152632313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1050152632313 is an equidigital number, since it uses as much as digits as its factorization.
1050152632313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16200, while the sum is 32.
The spelling of 1050152632313 in words is "one trillion, fifty billion, one hundred fifty-two million, six hundred thirty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •