Base | Representation |
---|---|
bin | 1001100011010001100000… |
… | …10010110000100010011100 |
3 | 2202100212221010211002002022 |
4 | 10301220300102300202130 |
5 | 10223104023234114322 |
6 | 112400423110115312 |
7 | 4265300611624103 |
oct | 461506022604234 |
9 | 82325833732068 |
10 | 21003200301212 |
11 | 6768453021668 |
12 | 243268934bb38 |
13 | b947935c521c |
14 | 5287bb72b03a |
15 | 26651c559942 |
hex | 131a304b089c |
21003200301212 has 12 divisors (see below), whose sum is σ = 36789290361096. Its totient is φ = 10491974483760.
The previous prime is 21003200301137. The next prime is 21003200301217. The reversal of 21003200301212 is 21210300230012.
It is a super-3 number, since 3×210032003012123 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21003200301217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2406411803 + ... + 2406420530.
It is an arithmetic number, because the mean of its divisors is an integer number (3065774196758).
Almost surely, 221003200301212 is an apocalyptic number.
It is an amenable number.
21003200301212 is a deficient number, since it is larger than the sum of its proper divisors (15786090059884).
21003200301212 is a wasteful number, since it uses less digits than its factorization.
21003200301212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4812833428 (or 4812833426 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 21003200301212 its reverse (21210300230012), we get a palindrome (42213500531224).
The spelling of 21003200301212 in words is "twenty-one trillion, three billion, two hundred million, three hundred one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •