Base | Representation |
---|---|
bin | 1001010001111101001111… |
… | …1100010100100000100110 |
3 | 1100010111120111021200221220 |
4 | 2110133103330110200212 |
5 | 2314141000400230342 |
6 | 33411411131321210 |
7 | 2102136121346655 |
oct | 224372374244046 |
9 | 40114514250856 |
10 | 10204103133222 |
11 | 328459921aa09 |
12 | 11897595b0206 |
13 | 590320568a7b |
14 | 273c4a12d19c |
15 | 12a6737105ec |
hex | 947d3f14826 |
10204103133222 has 8 divisors (see below), whose sum is σ = 20408206266456. Its totient is φ = 3401367711072.
The previous prime is 10204103133163. The next prime is 10204103133229. The reversal of 10204103133222 is 22233130140201.
It is a sphenic number, since it is the product of 3 distinct primes.
10204103133222 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 10204103133192 and 10204103133201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10204103133229) 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, 850341927763 + ... + 850341927774.
It is an arithmetic number, because the mean of its divisors is an integer number (2551025783307).
Almost surely, 210204103133222 is an apocalyptic number.
10204103133222 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10204103133222 is a wasteful number, since it uses less digits than its factorization.
10204103133222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1700683855542.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 10204103133222 its reverse (22233130140201), we get a palindrome (32437233273423).
The spelling of 10204103133222 in words is "ten trillion, two hundred four billion, one hundred three million, one hundred thirty-three thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •