Base | Representation |
---|---|
bin | 10011110000011001… |
… | …100100000000010101 |
3 | 2000202101012020111012 |
4 | 103300121210000111 |
5 | 321421023231401 |
6 | 13424542222005 |
7 | 1350452251502 |
oct | 236031440025 |
9 | 60671166435 |
10 | 21213102101 |
11 | 8aa6274644 |
12 | 4140284905 |
13 | 2000b08929 |
14 | 10534664a9 |
15 | 8424e38bb |
hex | 4f0664015 |
21213102101 has 8 divisors (see below), whose sum is σ = 22223605824. Its totient is φ = 20209948000.
The previous prime is 21213102049. The next prime is 21213102173. The reversal of 21213102101 is 10120131212.
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 21213102101 - 226 = 21145993237 is a prime.
It is a super-2 number, since 2×212131021012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21213102301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1831496 + ... + 1843041.
It is an arithmetic number, because the mean of its divisors is an integer number (2777950728).
Almost surely, 221213102101 is an apocalyptic number.
It is an amenable number.
21213102101 is a deficient number, since it is larger than the sum of its proper divisors (1010503723).
21213102101 is a wasteful number, since it uses less digits than its factorization.
21213102101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3674811.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 21213102101 its reverse (10120131212), we get a palindrome (31333233313).
The spelling of 21213102101 in words is "twenty-one billion, two hundred thirteen million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •