Base | Representation |
---|---|
bin | 1001001101000100101110… |
… | …0110000100101011011101 |
3 | 1022211111000220212000100201 |
4 | 2103101023212010223131 |
5 | 2311302143033034323 |
6 | 33305054424423501 |
7 | 2063106161021062 |
oct | 223211346045335 |
9 | 38744026760321 |
10 | 10120211221213 |
11 | 3251a59445825 |
12 | 1175446317b91 |
13 | 585441028552 |
14 | 26db6c538c69 |
15 | 1283b371c8ad |
hex | 9344b984add |
10120211221213 has 4 divisors (see below), whose sum is σ = 10560220404768. Its totient is φ = 9680202037660.
The previous prime is 10120211221193. The next prime is 10120211221229. The reversal of 10120211221213 is 31212211202101.
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 10120211221213 - 29 = 10120211220701 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 (10120211221243) 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, 220004591743 + ... + 220004591788.
It is an arithmetic number, because the mean of its divisors is an integer number (2640055101192).
Almost surely, 210120211221213 is an apocalyptic number.
It is an amenable number.
10120211221213 is a deficient number, since it is larger than the sum of its proper divisors (440009183555).
10120211221213 is an equidigital number, since it uses as much as digits as its factorization.
10120211221213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 440009183554.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 10120211221213 its reverse (31212211202101), we get a palindrome (41332422423314).
The spelling of 10120211221213 in words is "ten trillion, one hundred twenty billion, two hundred eleven million, two hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •