Base | Representation |
---|---|
bin | 1001011001011101011101… |
… | …1101010011101011011101 |
3 | 1100120211022022102111021201 |
4 | 2112113113131103223131 |
5 | 2323244001322143401 |
6 | 33550530401155501 |
7 | 2114351435301451 |
oct | 226272735235335 |
9 | 40524268374251 |
10 | 10333011131101 |
11 | 332422944774a |
12 | 11aa73462bb91 |
13 | 59c5251300a9 |
14 | 27a19857c661 |
15 | 12dbba76cb01 |
hex | 965d7753add |
10333011131101 has 2 divisors, whose sum is σ = 10333011131102. Its totient is φ = 10333011131100.
The previous prime is 10333011131059. The next prime is 10333011131129. The reversal of 10333011131101 is 10113111033301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8570250395001 + 1762760736100 = 2927499^2 + 1327690^2 .
It is a cyclic number.
It is not a de Polignac number, because 10333011131101 - 231 = 10330863647453 is a prime.
It is a super-2 number, since 2×103330111311012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10333011131701) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5166505565550 + 5166505565551.
It is an arithmetic number, because the mean of its divisors is an integer number (5166505565551).
Almost surely, 210333011131101 is an apocalyptic number.
It is an amenable number.
10333011131101 is a deficient number, since it is larger than the sum of its proper divisors (1).
10333011131101 is an equidigital number, since it uses as much as digits as its factorization.
10333011131101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81, while the sum is 19.
Adding to 10333011131101 its reverse (10113111033301), we get a palindrome (20446122164402).
The spelling of 10333011131101 in words is "ten trillion, three hundred thirty-three billion, eleven million, one hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •