Base | Representation |
---|---|
bin | 1001011001010111001010… |
… | …1010100010110001111011 |
3 | 1100120122221110110022110200 |
4 | 2112111302222202301323 |
5 | 2323232020421231021 |
6 | 33550050512413243 |
7 | 2114261512631466 |
oct | 226256252426173 |
9 | 40518843408420 |
10 | 10331320102011 |
11 | 3323540951547 |
12 | 11aa342247223 |
13 | 59c3159a4b6c |
14 | 27a077b502dd |
15 | 12db1c08c126 |
hex | 96572aa2c7b |
10331320102011 has 12 divisors (see below), whose sum is σ = 15800842509192. Its totient is φ = 6482396926656.
The previous prime is 10331320101953. The next prime is 10331320102109. The reversal of 10331320102011 is 11020102313301.
10331320102011 is a `hidden beast` number, since 1 + 0 + 331 + 320 + 1 + 0 + 2 + 0 + 11 = 666.
It is not a de Polignac number, because 10331320102011 - 213 = 10331320093819 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10331320102711) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 33762483841 + ... + 33762484146.
It is an arithmetic number, because the mean of its divisors is an integer number (1316736875766).
Almost surely, 210331320102011 is an apocalyptic number.
10331320102011 is a deficient number, since it is larger than the sum of its proper divisors (5469522407181).
10331320102011 is a wasteful number, since it uses less digits than its factorization.
10331320102011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67524968010 (or 67524968007 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 10331320102011 its reverse (11020102313301), we get a palindrome (21351422415312).
The spelling of 10331320102011 in words is "ten trillion, three hundred thirty-one billion, three hundred twenty million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •