Base | Representation |
---|---|
bin | 1001100011110011000011… |
… | …11001001100100011011001 |
3 | 2202102121102102121221210002 |
4 | 10301321201321030203121 |
5 | 10223402420324031301 |
6 | 112413002302302345 |
7 | 4266506144426126 |
oct | 461714171144331 |
9 | 82377372557702 |
10 | 21021212330201 |
11 | 677505637a636 |
12 | 24360755879b5 |
13 | b963a4177a45 |
14 | 5296099a974d |
15 | 266c239dc16b |
hex | 131e61e4c8d9 |
21021212330201 has 8 divisors (see below), whose sum is σ = 22212838567680. Its totient is φ = 19852724466432.
The previous prime is 21021212330089. The next prime is 21021212330203. The reversal of 21021212330201 is 10203321212012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21021212330201 - 230 = 21020138588377 is a prime.
It is a super-3 number, since 3×210212123302013 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21021212330203) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5784591560 + ... + 5784595193.
It is an arithmetic number, because the mean of its divisors is an integer number (2776604820960).
Almost surely, 221021212330201 is an apocalyptic number.
It is an amenable number.
21021212330201 is a deficient number, since it is larger than the sum of its proper divisors (1191626237479).
21021212330201 is a wasteful number, since it uses less digits than its factorization.
21021212330201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11569186855.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 21021212330201 its reverse (10203321212012), we get a palindrome (31224533542213).
The spelling of 21021212330201 in words is "twenty-one trillion, twenty-one billion, two hundred twelve million, three hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •