Base | Representation |
---|---|
bin | 1001101011000000101100… |
… | …10110101001000011010100 |
3 | 2210022022010212201201202122 |
4 | 10311200112112221003110 |
5 | 10241433010042140420 |
6 | 113122511301555112 |
7 | 4323431651164061 |
oct | 465402626510324 |
9 | 83268125651678 |
10 | 21269053083860 |
11 | 6860177a8a07a |
12 | 2476102a15a98 |
13 | bb3880aa3b7a |
14 | 5375db70bc68 |
15 | 26d3cbe89725 |
hex | 1358165a90d4 |
21269053083860 has 48 divisors (see below), whose sum is σ = 44695619482752. Its totient is φ = 8501792592000.
The previous prime is 21269053083833. The next prime is 21269053083893. The reversal of 21269053083860 is 6838035096212.
It is a Smith number, since the sum of its digits (53) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 258608945 + ... + 258691175.
It is an arithmetic number, because the mean of its divisors is an integer number (931158739224).
Almost surely, 221269053083860 is an apocalyptic number.
21269053083860 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21269053083860 is an abundant number, since it is smaller than the sum of its proper divisors (23426566398892).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21269053083860 is a wasteful number, since it uses less digits than its factorization.
21269053083860 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90944 (or 90942 counting only the distinct ones).
The product of its (nonzero) digits is 3732480, while the sum is 53.
The spelling of 21269053083860 in words is "twenty-one trillion, two hundred sixty-nine billion, fifty-three million, eighty-three thousand, eight hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •