Base | Representation |
---|---|
bin | 1001010001111001111101… |
… | …1000011110001000011110 |
3 | 1100010102022000222221221011 |
4 | 2110132133120132020132 |
5 | 2314132144124221342 |
6 | 33411143431125434 |
7 | 2102105223146410 |
oct | 224363730361036 |
9 | 40112260887834 |
10 | 10203221320222 |
11 | 328418648a837 |
12 | 118955221387a |
13 | 59020c96c528 |
14 | 273ba4d889b0 |
15 | 12a6210c7717 |
hex | 9479f61e21e |
10203221320222 has 8 divisors (see below), whose sum is σ = 17491236548976. Its totient is φ = 4372809137232.
The previous prime is 10203221320199. The next prime is 10203221320241. The reversal of 10203221320222 is 22202312230201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×102032213202222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10203221320193 and 10203221320202.
It is a congruent number.
It is an unprimeable number.
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, 364400761423 + ... + 364400761450.
It is an arithmetic number, because the mean of its divisors is an integer number (2186404568622).
Almost surely, 210203221320222 is an apocalyptic number.
10203221320222 is a deficient number, since it is larger than the sum of its proper divisors (7288015228754).
10203221320222 is an equidigital number, since it uses as much as digits as its factorization.
10203221320222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 728801522882.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 10203221320222 its reverse (22202312230201), we get a palindrome (32405533550423).
The spelling of 10203221320222 in words is "ten trillion, two hundred three billion, two hundred twenty-one million, three hundred twenty thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •