Base | Representation |
---|---|
bin | 1001011001010110101110… |
… | …0100010100101111001001 |
3 | 1100120122122011101212220102 |
4 | 2112111223210110233021 |
5 | 2323231244430443423 |
6 | 33550031020335145 |
7 | 2114255535560144 |
oct | 226255344245711 |
9 | 40518564355812 |
10 | 10331201031113 |
11 | 332348a714846 |
12 | 11aa30a3a44b5 |
13 | 59c2c7114b01 |
14 | 27a065dd705b |
15 | 12db118bbc28 |
hex | 9656b914bc9 |
10331201031113 has 2 divisors, whose sum is σ = 10331201031114. Its totient is φ = 10331201031112.
The previous prime is 10331201031101. The next prime is 10331201031119. The reversal of 10331201031113 is 31113010213301.
10331201031113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10242380938384 + 88820092729 = 3200372^2 + 298027^2 .
It is a cyclic number.
It is not a de Polignac number, because 10331201031113 - 26 = 10331201031049 is a prime.
It is not a weakly prime, because it can be changed into another prime (10331201031119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5165600515556 + 5165600515557.
It is an arithmetic number, because the mean of its divisors is an integer number (5165600515557).
Almost surely, 210331201031113 is an apocalyptic number.
It is an amenable number.
10331201031113 is a deficient number, since it is larger than the sum of its proper divisors (1).
10331201031113 is an equidigital number, since it uses as much as digits as its factorization.
10331201031113 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 10331201031113 its reverse (31113010213301), we get a palindrome (41444211244414).
The spelling of 10331201031113 in words is "ten trillion, three hundred thirty-one billion, two hundred one million, thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •