Base | Representation |
---|---|
bin | 1001100101001110101111… |
… | …00011111100011101000110 |
3 | 2202121022110120110002002210 |
4 | 10302213113203330131012 |
5 | 10230204220331022412 |
6 | 112451342235444250 |
7 | 4303200632235621 |
oct | 462472743743506 |
9 | 82538416402083 |
10 | 21070431110982 |
11 | 6793a1306a070 |
12 | 24437108b6686 |
13 | b9ac1910c076 |
14 | 52bb5865cdb8 |
15 | 2681549b983c |
hex | 1329d78fc746 |
21070431110982 has 64 divisors (see below), whose sum is σ = 46041932989440. Its totient is φ = 6375248640000.
The previous prime is 21070431110903. The next prime is 21070431110983. The reversal of 21070431110982 is 28901113407012.
It is a self number, because there is not a number n which added to its sum of digits gives 21070431110982.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21070431110983) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 275994888 + ... + 276071220.
It is an arithmetic number, because the mean of its divisors is an integer number (719405202960).
Almost surely, 221070431110982 is an apocalyptic number.
21070431110982 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
21070431110982 is an abundant number, since it is smaller than the sum of its proper divisors (24971501878458).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21070431110982 is a wasteful number, since it uses less digits than its factorization.
21070431110982 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82669.
The product of its (nonzero) digits is 24192, while the sum is 39.
Adding to 21070431110982 its reverse (28901113407012), we get a palindrome (49971544517994).
The spelling of 21070431110982 in words is "twenty-one trillion, seventy billion, four hundred thirty-one million, one hundred ten thousand, nine hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •