Base | Representation |
---|---|
bin | 1001100100000101111011… |
… | …00011111101100011011010 |
3 | 2202110120120021000011022111 |
4 | 10302002331203331203122 |
5 | 10224034141042432302 |
6 | 112421355253542534 |
7 | 4300315134056551 |
oct | 462027543754332 |
9 | 82416507004274 |
10 | 21031340202202 |
11 | 6779383292790 |
12 | 2438021344a4a |
13 | b973294b7205 |
14 | 529ccaad6d98 |
15 | 267117c080d7 |
hex | 1320bd8fd8da |
21031340202202 has 8 divisors (see below), whose sum is σ = 34414920330912. Its totient is φ = 9559700091900.
The previous prime is 21031340202179. The next prime is 21031340202217. The reversal of 21031340202202 is 20220204313012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 955970009191 = 21031340202202 / (2 + 1 + 0 + 3 + 1 + 3 + 4 + 0 + 2 + 0 + 2 + 2 + 0 + 2).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 477985004574 + ... + 477985004617.
It is an arithmetic number, because the mean of its divisors is an integer number (4301865041364).
Almost surely, 221031340202202 is an apocalyptic number.
21031340202202 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
21031340202202 is a deficient number, since it is larger than the sum of its proper divisors (13383580128710).
21031340202202 is a wasteful number, since it uses less digits than its factorization.
21031340202202 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 955970009204.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 21031340202202 its reverse (20220204313012), we get a palindrome (41251544515214).
The spelling of 21031340202202 in words is "twenty-one trillion, thirty-one billion, three hundred forty million, two hundred two thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •