Base | Representation |
---|---|
bin | 1001001101110101100100… |
… | …0100001110011100001011 |
3 | 1022212201212122100020201220 |
4 | 2103131121010032130023 |
5 | 2312011020431144321 |
6 | 33315103421013123 |
7 | 2064052111640346 |
oct | 223353104163413 |
9 | 38781778306656 |
10 | 10133322131211 |
11 | 3257577193534 |
12 | 1177aa50b41a3 |
13 | 586750390866 |
14 | 2706538d545d |
15 | 1288ce77b9c6 |
hex | 9375910e70b |
10133322131211 has 4 divisors (see below), whose sum is σ = 13511096174952. Its totient is φ = 6755548087472.
The previous prime is 10133322131209. The next prime is 10133322131213. The reversal of 10133322131211 is 11213122333101.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (10133322131209) and next prime (10133322131213).
It is a cyclic number.
It is not a de Polignac number, because 10133322131211 - 21 = 10133322131209 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10133322131213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1688887021866 + ... + 1688887021871.
It is an arithmetic number, because the mean of its divisors is an integer number (3377774043738).
Almost surely, 210133322131211 is an apocalyptic number.
10133322131211 is a deficient number, since it is larger than the sum of its proper divisors (3377774043741).
10133322131211 is an equidigital number, since it uses as much as digits as its factorization.
10133322131211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3377774043740.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 10133322131211 its reverse (11213122333101), we get a palindrome (21346444464312).
The spelling of 10133322131211 in words is "ten trillion, one hundred thirty-three billion, three hundred twenty-two million, one hundred thirty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •