Base | Representation |
---|---|
bin | 10011101010011100… |
… | …011110001001010001 |
3 | 2000111102012202021001 |
4 | 103222130132021101 |
5 | 321214434414413 |
6 | 13411013102001 |
7 | 1345130151355 |
oct | 235234361121 |
9 | 60442182231 |
10 | 21113201233 |
11 | 8a54940643 |
12 | 4112927901 |
13 | 1cb61cb2a7 |
14 | 104409d465 |
15 | 83885d4dd |
hex | 4ea71e251 |
21113201233 has 16 divisors (see below), whose sum is σ = 22568841216. Its totient is φ = 19707589440.
The previous prime is 21113201203. The next prime is 21113201243. The reversal of 21113201233 is 33210231112.
It is a cyclic number.
It is not a de Polignac number, because 21113201233 - 221 = 21111104081 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21113201233.
It is not an unprimeable number, because it can be changed into a prime (21113201203) 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 15 ways as a sum of consecutive naturals, for example, 118935 + ... + 237427.
It is an arithmetic number, because the mean of its divisors is an integer number (1410552576).
Almost surely, 221113201233 is an apocalyptic number.
21113201233 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
21113201233 is a deficient number, since it is larger than the sum of its proper divisors (1455639983).
21113201233 is a wasteful number, since it uses less digits than its factorization.
21113201233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118704.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 21113201233 its reverse (33210231112), we get a palindrome (54323432345).
The spelling of 21113201233 in words is "twenty-one billion, one hundred thirteen million, two hundred one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •