Base | Representation |
---|---|
bin | 10011110000110101… |
… | …000001100011100111 |
3 | 2000202212201222120020 |
4 | 103300311001203213 |
5 | 321424344113111 |
6 | 13425400410223 |
7 | 1350600403566 |
oct | 236065014347 |
9 | 60685658506 |
10 | 21220301031 |
11 | 8aaa341276 |
12 | 4142776973 |
13 | 2002459557 |
14 | 10543bbbdd |
15 | 842e66906 |
hex | 4f0d418e7 |
21220301031 has 8 divisors (see below), whose sum is σ = 29782878720. Its totient is φ = 13402295352.
The previous prime is 21220301029. The next prime is 21220301059. The reversal of 21220301031 is 13010302212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21220301031 - 21 = 21220301029 is a prime.
It is a super-2 number, since 2×212203010312 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 21220301031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21220301131) 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 7 ways as a sum of consecutive naturals, for example, 186142935 + ... + 186143048.
It is an arithmetic number, because the mean of its divisors is an integer number (3722859840).
Almost surely, 221220301031 is an apocalyptic number.
21220301031 is a deficient number, since it is larger than the sum of its proper divisors (8562577689).
21220301031 is a wasteful number, since it uses less digits than its factorization.
21220301031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 372286005.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 21220301031 its reverse (13010302212), we get a palindrome (34230603243).
The spelling of 21220301031 in words is "twenty-one billion, two hundred twenty million, three hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •