Base | Representation |
---|---|
bin | 10011000010011100… |
… | …11010011110100101 |
3 | 222101022210211102212 |
4 | 21201032122132211 |
5 | 131413100244023 |
6 | 4410121413205 |
7 | 511200641102 |
oct | 114116323645 |
9 | 28338724385 |
10 | 10221103013 |
11 | 4375600a80 |
12 | 1b9303a205 |
13 | c6b752c64 |
14 | 6cd679aa9 |
15 | 3ec4d4e78 |
hex | 26139a7a5 |
10221103013 has 8 divisors (see below), whose sum is σ = 11186150976. Its totient is φ = 9262031200.
The previous prime is 10221103003. The next prime is 10221103021. The reversal of 10221103013 is 31030112201.
10221103013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10221103013 - 230 = 9147361189 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10221103003) 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 7 ways as a sum of consecutive naturals, for example, 1490456 + ... + 1497297.
It is an arithmetic number, because the mean of its divisors is an integer number (1398268872).
Almost surely, 210221103013 is an apocalyptic number.
It is an amenable number.
10221103013 is a deficient number, since it is larger than the sum of its proper divisors (965047963).
10221103013 is a wasteful number, since it uses less digits than its factorization.
10221103013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2988075.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 10221103013 its reverse (31030112201), we get a palindrome (41251215214).
The spelling of 10221103013 in words is "ten billion, two hundred twenty-one million, one hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •