Base | Representation |
---|---|
bin | 11110000111110111001… |
… | …01110011000000110101 |
3 | 10122221112211211020211202 |
4 | 33003323211303000311 |
5 | 113424201330444113 |
6 | 2111251203342245 |
7 | 134530406351651 |
oct | 17037345630065 |
9 | 3587484736752 |
10 | 1035013140533 |
11 | 369a45a31679 |
12 | 148713981985 |
13 | 767a8140688 |
14 | 381485b3a61 |
15 | 1bdca540258 |
hex | f0fb973035 |
1035013140533 has 2 divisors, whose sum is σ = 1035013140534. Its totient is φ = 1035013140532.
The previous prime is 1035013140517. The next prime is 1035013140541. The reversal of 1035013140533 is 3350413105301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1012563212644 + 22449927889 = 1006262^2 + 149833^2 .
It is a cyclic number.
It is not a de Polignac number, because 1035013140533 - 24 = 1035013140517 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1035013140496 and 1035013140505.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1035013140563) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 517506570266 + 517506570267.
It is an arithmetic number, because the mean of its divisors is an integer number (517506570267).
Almost surely, 21035013140533 is an apocalyptic number.
It is an amenable number.
1035013140533 is a deficient number, since it is larger than the sum of its proper divisors (1).
1035013140533 is an equidigital number, since it uses as much as digits as its factorization.
1035013140533 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8100, while the sum is 29.
Adding to 1035013140533 its reverse (3350413105301), we get a palindrome (4385426245834).
The spelling of 1035013140533 in words is "one trillion, thirty-five billion, thirteen million, one hundred forty thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •