Base | Representation |
---|---|
bin | 10011100011111000… |
… | …001010111100110011 |
3 | 2000012201220001221120 |
4 | 103203320022330303 |
5 | 321003233202011 |
6 | 13352035353323 |
7 | 1342321512450 |
oct | 234370127463 |
9 | 60181801846 |
10 | 21003022131 |
11 | 89a8727433 |
12 | 40a1a52843 |
13 | 1c99432560 |
14 | 10335bc827 |
15 | 82dd47a06 |
hex | 4e3e0af33 |
21003022131 has 32 divisors (see below), whose sum is σ = 34589280768. Its totient is φ = 11039051520.
The previous prime is 21003022121. The next prime is 21003022163. The reversal of 21003022131 is 13122030012.
It is a de Polignac number, because none of the positive numbers 2k-21003022131 is a prime.
It is a super-2 number, since 2×210030221312 (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 21003022131.
It is not an unprimeable number, because it can be changed into a prime (21003022121) 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 31 ways as a sum of consecutive naturals, for example, 60181 + ... + 213606.
It is an arithmetic number, because the mean of its divisors is an integer number (1080915024).
Almost surely, 221003022131 is an apocalyptic number.
21003022131 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
21003022131 is a deficient number, since it is larger than the sum of its proper divisors (13586258637).
21003022131 is a wasteful number, since it uses less digits than its factorization.
21003022131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 274091.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 21003022131 its reverse (13122030012), we get a palindrome (34125052143).
The spelling of 21003022131 in words is "twenty-one billion, three million, twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •