Base | Representation |
---|---|
bin | 11110001000011011000… |
… | …11100101110110000101 |
3 | 10122222022211222112220201 |
4 | 33010031203211312011 |
5 | 113430311011132242 |
6 | 2111341131530501 |
7 | 134541026331112 |
oct | 17041543456605 |
9 | 3588284875821 |
10 | 1035314552197 |
11 | 36a09008a722 |
12 | 1487988b9a31 |
13 | 76825713b83 |
14 | 38176633909 |
15 | 1bde6c2c4b7 |
hex | f10d8e5d85 |
1035314552197 has 2 divisors, whose sum is σ = 1035314552198. Its totient is φ = 1035314552196.
The previous prime is 1035314552177. The next prime is 1035314552257. The reversal of 1035314552197 is 7912554135301.
1035314552197 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 876144672676 + 159169879521 = 936026^2 + 398961^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1035314552197 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1035314552177) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 517657276098 + 517657276099.
It is an arithmetic number, because the mean of its divisors is an integer number (517657276099).
Almost surely, 21035314552197 is an apocalyptic number.
It is an amenable number.
1035314552197 is a deficient number, since it is larger than the sum of its proper divisors (1).
1035314552197 is an equidigital number, since it uses as much as digits as its factorization.
1035314552197 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 567000, while the sum is 46.
Adding to 1035314552197 its reverse (7912554135301), we get a palindrome (8947868687498).
The spelling of 1035314552197 in words is "one trillion, thirty-five billion, three hundred fourteen million, five hundred fifty-two thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •