Base | Representation |
---|---|
bin | 1001011001010110110011… |
… | …1000111011110011001101 |
3 | 1100120122200201010202021121 |
4 | 2112111230320323303031 |
5 | 2323231321120224323 |
6 | 33550033132000541 |
7 | 2114256225236152 |
oct | 226255470736315 |
9 | 40518621122247 |
10 | 10331223211213 |
11 | 33234a1194003 |
12 | 11aa315900151 |
13 | 59c2cb8ac628 |
14 | 27a068d2c229 |
15 | 12db137eda5d |
hex | 9656ce3bccd |
10331223211213 has 4 divisors (see below), whose sum is σ = 10399641908128. Its totient is φ = 10262804514300.
The previous prime is 10331223211201. The next prime is 10331223211291. The reversal of 10331223211213 is 31211232213301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10331223211213 - 233 = 10322633276621 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10331223212213) 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, 34209348231 + ... + 34209348532.
It is an arithmetic number, because the mean of its divisors is an integer number (2599910477032).
Almost surely, 210331223211213 is an apocalyptic number.
It is an amenable number.
10331223211213 is a deficient number, since it is larger than the sum of its proper divisors (68418696915).
10331223211213 is an equidigital number, since it uses as much as digits as its factorization.
10331223211213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68418696914.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 10331223211213 its reverse (31211232213301), we get a palindrome (41542455424514).
The spelling of 10331223211213 in words is "ten trillion, three hundred thirty-one billion, two hundred twenty-three million, two hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •