Base | Representation |
---|---|
bin | 1001010010111001010011… |
… | …0001100111010011110110 |
3 | 1100012001011221002112020120 |
4 | 2110232110301213103312 |
5 | 2314422004121344342 |
6 | 33423034501112410 |
7 | 2103246442050144 |
oct | 224562461472366 |
9 | 40161157075216 |
10 | 10220223231222 |
11 | 3290410634154 |
12 | 11908b80b8706 |
13 | 5919bc1816b4 |
14 | 274939004594 |
15 | 12acb8a2aaec |
hex | 94b94c674f6 |
10220223231222 has 64 divisors (see below), whose sum is σ = 21397892014080. Its totient is φ = 3250544976000.
The previous prime is 10220223231203. The next prime is 10220223231277. The reversal of 10220223231222 is 22213232202201.
It is a super-2 number, since 2×102202232312222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10220223231192 and 10220223231201.
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 31 ways as a sum of consecutive naturals, for example, 3351708 + ... + 5628000.
It is an arithmetic number, because the mean of its divisors is an integer number (334342062720).
Almost surely, 210220223231222 is an apocalyptic number.
10220223231222 is an abundant number, since it is smaller than the sum of its proper divisors (11177668782858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10220223231222 is a wasteful number, since it uses less digits than its factorization.
10220223231222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2276669.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 10220223231222 its reverse (22213232202201), we get a palindrome (32433455433423).
The spelling of 10220223231222 in words is "ten trillion, two hundred twenty billion, two hundred twenty-three million, two hundred thirty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •