Base | Representation |
---|---|
bin | 10011110000011001… |
… | …100011110000111001 |
3 | 2000202101012012010121 |
4 | 103300121203300321 |
5 | 321421023213423 |
6 | 13424542213241 |
7 | 1350452245561 |
oct | 236031436071 |
9 | 60671165117 |
10 | 21213101113 |
11 | 8aa6273926 |
12 | 4140284221 |
13 | 2000b08349 |
14 | 1053465da1 |
15 | 8424e345d |
hex | 4f0663c39 |
21213101113 has 4 divisors (see below), whose sum is σ = 21323013748. Its totient is φ = 21103188480.
The previous prime is 21213101101. The next prime is 21213101131. The reversal of 21213101113 is 31110131212.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 8217785104 + 12995316009 = 90652^2 + 113997^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21213101113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21213101153) 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, 54956028 + ... + 54956413.
It is an arithmetic number, because the mean of its divisors is an integer number (5330753437).
Almost surely, 221213101113 is an apocalyptic number.
It is an amenable number.
21213101113 is a deficient number, since it is larger than the sum of its proper divisors (109912635).
21213101113 is a wasteful number, since it uses less digits than its factorization.
21213101113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109912634.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 21213101113 its reverse (31110131212), we get a palindrome (52323232325).
The spelling of 21213101113 in words is "twenty-one billion, two hundred thirteen million, one hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •