Base | Representation |
---|---|
bin | 1001011001010111001000… |
… | …1111100001110100110011 |
3 | 1100120122220222010112001210 |
4 | 2112111302033201310303 |
5 | 2323232012113121321 |
6 | 33550050100531203 |
7 | 2114261365505031 |
oct | 226256217416463 |
9 | 40518828115053 |
10 | 10331313020211 |
11 | 3323537954917 |
12 | 11aa33b9b0b03 |
13 | 59c314395651 |
14 | 27a076c29551 |
15 | 12db1b63db76 |
hex | 965723e1d33 |
10331313020211 has 4 divisors (see below), whose sum is σ = 13775084026952. Its totient is φ = 6887542013472.
The previous prime is 10331313020209. The next prime is 10331313020227. The reversal of 10331313020211 is 11202031313301.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 10331313020211 - 21 = 10331313020209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10331313020411) 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 3 ways as a sum of consecutive naturals, for example, 1721885503366 + ... + 1721885503371.
It is an arithmetic number, because the mean of its divisors is an integer number (3443771006738).
Almost surely, 210331313020211 is an apocalyptic number.
10331313020211 is a deficient number, since it is larger than the sum of its proper divisors (3443771006741).
10331313020211 is an equidigital number, since it uses as much as digits as its factorization.
10331313020211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3443771006740.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 10331313020211 its reverse (11202031313301), we get a palindrome (21533344333512).
The spelling of 10331313020211 in words is "ten trillion, three hundred thirty-one billion, three hundred thirteen million, twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •