Base | Representation |
---|---|
bin | 10011110001101001… |
… | …010101001110101101 |
3 | 2000210211112121222200 |
4 | 103301221111032231 |
5 | 321441401404401 |
6 | 13431010332113 |
7 | 1351125063510 |
oct | 236151251655 |
9 | 60724477880 |
10 | 21234013101 |
11 | 9007057364 |
12 | 414728a039 |
13 | 200524a8c2 |
14 | 105614ad77 |
15 | 844274686 |
hex | 4f1a553ad |
21234013101 has 24 divisors (see below), whose sum is σ = 35393304960. Its totient is φ = 12015914976.
The previous prime is 21234013091. The next prime is 21234013169. The reversal of 21234013101 is 10131043212.
21234013101 is a `hidden beast` number, since 2 + 12 + 340 + 1 + 310 + 1 = 666.
It is not a de Polignac number, because 21234013101 - 25 = 21234013069 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21234013601) 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 23 ways as a sum of consecutive naturals, for example, 1629666 + ... + 1642643.
It is an arithmetic number, because the mean of its divisors is an integer number (1474721040).
Almost surely, 221234013101 is an apocalyptic number.
21234013101 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
21234013101 is a deficient number, since it is larger than the sum of its proper divisors (14159291859).
21234013101 is a wasteful number, since it uses less digits than its factorization.
21234013101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3272425 (or 3272422 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 21234013101 its reverse (10131043212), we get a palindrome (31365056313).
The spelling of 21234013101 in words is "twenty-one billion, two hundred thirty-four million, thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •