Base | Representation |
---|---|
bin | 1001100100000011110101… |
… | …10111110001001100110010 |
3 | 2202110110200021122002212100 |
4 | 10302001322313301030302 |
5 | 10224024343124233020 |
6 | 112421052244241230 |
7 | 4300245326534346 |
oct | 462017267611462 |
9 | 82413607562770 |
10 | 21030221321010 |
11 | 6778959751790 |
12 | 243796a6a0216 |
13 | b971ab755435 |
14 | 529c22281626 |
15 | 26709e892a90 |
hex | 13207adf1332 |
21030221321010 has 48 divisors (see below), whose sum is σ = 59649355022400. Its totient is φ = 5098235471520.
The previous prime is 21030221321009. The next prime is 21030221321027. The reversal of 21030221321010 is 1012312203012.
21030221321010 is a `hidden beast` number, since 2 + 10 + 302 + 21 + 321 + 0 + 10 = 666.
It is a super-3 number, since 3×210302213210103 (a number of 41 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
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, 10621322910 + ... + 10621324889.
It is an arithmetic number, because the mean of its divisors is an integer number (1242694896300).
Almost surely, 221030221321010 is an apocalyptic number.
21030221321010 is an abundant number, since it is smaller than the sum of its proper divisors (38619133701390).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21030221321010 is a wasteful number, since it uses less digits than its factorization.
21030221321010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21242647823 (or 21242647820 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 21030221321010 its reverse (1012312203012), we get a palindrome (22042533524022).
The spelling of 21030221321010 in words is "twenty-one trillion, thirty billion, two hundred twenty-one million, three hundred twenty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •