Base | Representation |
---|---|
bin | 10011000010011100… |
… | …11010101110011111 |
3 | 222101022210212211120 |
4 | 21201032122232133 |
5 | 131413100312111 |
6 | 4410121422023 |
7 | 511200644055 |
oct | 114116325637 |
9 | 28338725746 |
10 | 10221104031 |
11 | 4375601816 |
12 | 1b9303a913 |
13 | c6b753568 |
14 | 6cd67a1d5 |
15 | 3ec4d5406 |
hex | 26139ab9f |
10221104031 has 4 divisors (see below), whose sum is σ = 13628138712. Its totient is φ = 6814069352.
The previous prime is 10221103951. The next prime is 10221104039. The reversal of 10221104031 is 13040112201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10221104031 - 211 = 10221101983 is a prime.
It is a super-2 number, since 2×102211040312 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10221104031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10221104039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1703517336 + ... + 1703517341.
It is an arithmetic number, because the mean of its divisors is an integer number (3407034678).
Almost surely, 210221104031 is an apocalyptic number.
10221104031 is a deficient number, since it is larger than the sum of its proper divisors (3407034681).
10221104031 is an equidigital number, since it uses as much as digits as its factorization.
10221104031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3407034680.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 10221104031 its reverse (13040112201), we get a palindrome (23261216232).
The spelling of 10221104031 in words is "ten billion, two hundred twenty-one million, one hundred four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •