Base | Representation |
---|---|
bin | 1001111001000110111010… |
… | …00100011011000011010100 |
3 | 2212000121101110202201110002 |
4 | 10330203131010123003110 |
5 | 10322402002331423220 |
6 | 114133215032550432 |
7 | 4403430052163630 |
oct | 474433504330324 |
9 | 85017343681402 |
10 | 21753423311060 |
11 | 6a27636391971 |
12 | 2533b61552418 |
13 | c1a453a8456c |
14 | 552c2ac13dc0 |
15 | 27acca858c75 |
hex | 13c8dd11b0d4 |
21753423311060 has 24 divisors (see below), whose sum is σ = 52208215946880. Its totient is φ = 7458316563744.
The previous prime is 21753423311057. The next prime is 21753423311101. The reversal of 21753423311060 is 6011332435712.
It is a super-2 number, since 2×217534233110602 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 77690797400 + ... + 77690797679.
It is an arithmetic number, because the mean of its divisors is an integer number (2175342331120).
Almost surely, 221753423311060 is an apocalyptic number.
21753423311060 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21753423311060 is an abundant number, since it is smaller than the sum of its proper divisors (30454792635820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21753423311060 is a wasteful number, since it uses less digits than its factorization.
21753423311060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155381595095 (or 155381595093 counting only the distinct ones).
The product of its (nonzero) digits is 90720, while the sum is 38.
Adding to 21753423311060 its reverse (6011332435712), we get a palindrome (27764755746772).
The spelling of 21753423311060 in words is "twenty-one trillion, seven hundred fifty-three billion, four hundred twenty-three million, three hundred eleven thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •