Base | Representation |
---|---|
bin | 1001001101110100110110… |
… | …1111101101000011101101 |
3 | 1022212201101101221212010212 |
4 | 2103131031233231003231 |
5 | 2312010123320432341 |
6 | 33315032514112205 |
7 | 2064044314366460 |
oct | 223351557550355 |
9 | 38781341855125 |
10 | 10133132202221 |
11 | 3257489a5a026 |
12 | 1177a5157b665 |
13 | 58671cc21542 |
14 | 2706365b52d7 |
15 | 1288bcc615eb |
hex | 9374dbed0ed |
10133132202221 has 4 divisors (see below), whose sum is σ = 11580722516832. Its totient is φ = 8685541887612.
The previous prime is 10133132202181. The next prime is 10133132202247. The reversal of 10133132202221 is 12220223133101.
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 10133132202221 - 230 = 10132058460397 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10133132232221) 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, 723795157295 + ... + 723795157308.
It is an arithmetic number, because the mean of its divisors is an integer number (2895180629208).
Almost surely, 210133132202221 is an apocalyptic number.
It is an amenable number.
10133132202221 is a deficient number, since it is larger than the sum of its proper divisors (1447590314611).
10133132202221 is an equidigital number, since it uses as much as digits as its factorization.
10133132202221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1447590314610.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 10133132202221 its reverse (12220223133101), we get a palindrome (22353355335322).
The spelling of 10133132202221 in words is "ten trillion, one hundred thirty-three billion, one hundred thirty-two million, two hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.035 sec. • engine limits •