Base | Representation |
---|---|
bin | 10011110000111011… |
… | …100101011110100111 |
3 | 2000202222222100221221 |
4 | 103300323211132213 |
5 | 321430314133111 |
6 | 13425501321211 |
7 | 1350621126301 |
oct | 236073453647 |
9 | 60688870857 |
10 | 21222021031 |
11 | 9000306562 |
12 | 4143266207 |
13 | 200290c3c3 |
14 | 1054708971 |
15 | 8431a6371 |
hex | 4f0ee57a7 |
21222021031 has 4 divisors (see below), whose sum is σ = 21376926432. Its totient is φ = 21067115632.
The previous prime is 21222021011. The next prime is 21222021047. The reversal of 21222021031 is 13012022212.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21222021031 is a prime.
It is a super-3 number, since 3×212220210313 (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 junction number, because it is equal to n+sod(n) for n = 21222020996 and 21222021014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21222021001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 77452495 + ... + 77452768.
It is an arithmetic number, because the mean of its divisors is an integer number (5344231608).
Almost surely, 221222021031 is an apocalyptic number.
21222021031 is a deficient number, since it is larger than the sum of its proper divisors (154905401).
21222021031 is a wasteful number, since it uses less digits than its factorization.
21222021031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154905400.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 21222021031 its reverse (13012022212), we get a palindrome (34234043243).
The spelling of 21222021031 in words is "twenty-one billion, two hundred twenty-two million, twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •