Base | Representation |
---|---|
bin | 11110000010011111110… |
… | …11010100011000111001 |
3 | 10122200010010112002111002 |
4 | 33001033323110120321 |
5 | 113402302033213423 |
6 | 2110053322214345 |
7 | 134366135414402 |
oct | 17011773243071 |
9 | 3580103462432 |
10 | 1032133101113 |
11 | 3687a8256404 |
12 | 14804b3543b5 |
13 | 7643956b13a |
14 | 37d53cb69a9 |
15 | 1bcac795228 |
hex | f04fed4639 |
1032133101113 has 2 divisors, whose sum is σ = 1032133101114. Its totient is φ = 1032133101112.
The previous prime is 1032133101047. The next prime is 1032133101151. The reversal of 1032133101113 is 3111013312301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 691137834409 + 340995266704 = 831347^2 + 583948^2 .
It is a cyclic number.
It is not a de Polignac number, because 1032133101113 - 28 = 1032133100857 is a prime.
It is not a weakly prime, because it can be changed into another prime (1032133101173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 516066550556 + 516066550557.
It is an arithmetic number, because the mean of its divisors is an integer number (516066550557).
Almost surely, 21032133101113 is an apocalyptic number.
It is an amenable number.
1032133101113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1032133101113 is an equidigital number, since it uses as much as digits as its factorization.
1032133101113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 1032133101113 its reverse (3111013312301), we get a palindrome (4143146413414).
The spelling of 1032133101113 in words is "one trillion, thirty-two billion, one hundred thirty-three million, one hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •