Base | Representation |
---|---|
bin | 10011101010011011… |
… | …110000010001010011 |
3 | 2000111101212012111201 |
4 | 103222123300101103 |
5 | 321214412411311 |
6 | 13411005052031 |
7 | 1345125436504 |
oct | 235233602123 |
9 | 60441765451 |
10 | 21113013331 |
11 | 8a54822453 |
12 | 4112857017 |
13 | 1cb61638c7 |
14 | 1044050bab |
15 | 8388229c1 |
hex | 4ea6f0453 |
21113013331 has 4 divisors (see below), whose sum is σ = 21115329664. Its totient is φ = 21110697000.
The previous prime is 21113013301. The next prime is 21113013349. The reversal of 21113013331 is 13331031112.
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 21113013331 - 27 = 21113013203 is a prime.
It is a super-2 number, since 2×211130133312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21113013299 and 21113013308.
It is not an unprimeable number, because it can be changed into a prime (21113013301) 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 3 ways as a sum of consecutive naturals, for example, 1144440 + ... + 1162741.
It is an arithmetic number, because the mean of its divisors is an integer number (5278832416).
Almost surely, 221113013331 is an apocalyptic number.
21113013331 is a deficient number, since it is larger than the sum of its proper divisors (2316333).
21113013331 is an equidigital number, since it uses as much as digits as its factorization.
21113013331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2316332.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 21113013331 its reverse (13331031112), we get a palindrome (34444044443).
The spelling of 21113013331 in words is "twenty-one billion, one hundred thirteen million, thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •