Base | Representation |
---|---|
bin | 10011000010011101… |
… | …00001010111010111 |
3 | 222101022212021010200 |
4 | 21201032201113113 |
5 | 131413102144343 |
6 | 4410122151543 |
7 | 511201116252 |
oct | 114116412727 |
9 | 28338767120 |
10 | 10221131223 |
11 | 4375620196 |
12 | 1b930525b3 |
13 | c6b762a54 |
14 | 6cd686099 |
15 | 3ec4dd4d3 |
hex | 2613a15d7 |
10221131223 has 12 divisors (see below), whose sum is σ = 14780975040. Its totient is φ = 6806186496.
The previous prime is 10221131191. The next prime is 10221131317. The reversal of 10221131223 is 32213112201.
10221131223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10221131223 - 25 = 10221131191 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10221131196 and 10221131205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10221131423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 650218 + ... + 665751.
It is an arithmetic number, because the mean of its divisors is an integer number (1231747920).
Almost surely, 210221131223 is an apocalyptic number.
10221131223 is a deficient number, since it is larger than the sum of its proper divisors (4559843817).
10221131223 is a wasteful number, since it uses less digits than its factorization.
10221131223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1316838 (or 1316835 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 10221131223 its reverse (32213112201), we get a palindrome (42434243424).
The spelling of 10221131223 in words is "ten billion, two hundred twenty-one million, one hundred thirty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •