Base | Representation |
---|---|
bin | 10011101010111111… |
… | …110011001110100111 |
3 | 2000112001122021111210 |
4 | 103222333303032213 |
5 | 321224322301011 |
6 | 13411543402503 |
7 | 1345301653464 |
oct | 235277631647 |
9 | 60461567453 |
10 | 21122462631 |
11 | 8a5a096896 |
12 | 4115a53433 |
13 | 1cb80c18ca |
14 | 10453d066b |
15 | 83958c6a6 |
hex | 4eaff33a7 |
21122462631 has 4 divisors (see below), whose sum is σ = 28163283512. Its totient is φ = 14081641752.
The previous prime is 21122462573. The next prime is 21122462671. The reversal of 21122462631 is 13626422112.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 21122462631 - 27 = 21122462503 is a prime.
It is a super-3 number, since 3×211224626313 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21122462671) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3520410436 + ... + 3520410441.
It is an arithmetic number, because the mean of its divisors is an integer number (7040820878).
Almost surely, 221122462631 is an apocalyptic number.
21122462631 is a deficient number, since it is larger than the sum of its proper divisors (7040820881).
21122462631 is an equidigital number, since it uses as much as digits as its factorization.
21122462631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7040820880.
The product of its digits is 6912, while the sum is 30.
Adding to 21122462631 its reverse (13626422112), we get a palindrome (34748884743).
The spelling of 21122462631 in words is "twenty-one billion, one hundred twenty-two million, four hundred sixty-two thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •