Base | Representation |
---|---|
bin | 1001101011111100001111… |
… | …11010100101010010010110 |
3 | 2210102100122220221221010100 |
4 | 10311332013322211102112 |
5 | 10242443443403231402 |
6 | 113145315510234530 |
7 | 4325643131643252 |
oct | 465760772452226 |
9 | 83370586857110 |
10 | 21301023102102 |
11 | 6872793251a57 |
12 | 2480345655a46 |
13 | bb68a7346723 |
14 | 538d91649262 |
15 | 26e14da0271c |
hex | 135f87ea5496 |
21301023102102 has 48 divisors (see below), whose sum is σ = 48591492768000. Its totient is φ = 6725224904112.
The previous prime is 21301023102043. The next prime is 21301023102113. The reversal of 21301023102102 is 20120132010312.
21301023102102 is a `hidden beast` number, since 2 + 130 + 10 + 2 + 310 + 210 + 2 = 666.
It is a super-2 number, since 2×213010231021022 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4916202 + ... + 8171357.
It is an arithmetic number, because the mean of its divisors is an integer number (1012322766000).
Almost surely, 221301023102102 is an apocalyptic number.
21301023102102 is an abundant number, since it is smaller than the sum of its proper divisors (27290469665898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21301023102102 is a wasteful number, since it uses less digits than its factorization.
21301023102102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13092345 (or 13092342 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 21301023102102 its reverse (20120132010312), we get a palindrome (41421155112414).
The spelling of 21301023102102 in words is "twenty-one trillion, three hundred one billion, twenty-three million, one hundred two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •