Base | Representation |
---|---|
bin | 1001101011111100011010… |
… | …00110111010011000011000 |
3 | 2210102100212222212222211201 |
4 | 10311332031012322120120 |
5 | 10242444133204022222 |
6 | 113145332301403544 |
7 | 4325645240304226 |
oct | 465761506723030 |
9 | 83370788788751 |
10 | 21301110220312 |
11 | 687282844517a |
12 | 248036a8695b4 |
13 | bb68bc3c9a70 |
14 | 538d9d045b16 |
15 | 26e1564b0427 |
hex | 135f8d1ba618 |
21301110220312 has 64 divisors (see below), whose sum is σ = 44401080729600. Its totient is φ = 9513769749120.
The previous prime is 21301110220303. The next prime is 21301110220363. The reversal of 21301110220312 is 21302201110312.
It is a self number, because there is not a number n which added to its sum of digits gives 21301110220312.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 92113489 + ... + 92344447.
It is an arithmetic number, because the mean of its divisors is an integer number (693766886400).
Almost surely, 221301110220312 is an apocalyptic number.
It is an amenable number.
21301110220312 is an abundant number, since it is smaller than the sum of its proper divisors (23099970509288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21301110220312 is a wasteful number, since it uses less digits than its factorization.
21301110220312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259616 (or 259612 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 21301110220312 its reverse (21302201110312), we get a palindrome (42603311330624).
The spelling of 21301110220312 in words is "twenty-one trillion, three hundred one billion, one hundred ten million, two hundred twenty thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •