Base | Representation |
---|---|
bin | 1001101100100000001001… |
… | …11110101111000111000111 |
3 | 2210111012102110010101110110 |
4 | 10312100010332233013013 |
5 | 10243302434102241403 |
6 | 113202224451124103 |
7 | 4330224640115505 |
oct | 466200476570707 |
9 | 83435373111413 |
10 | 21320301212103 |
11 | 687a986240373 |
12 | 24840258a3633 |
13 | bb865a2b94ca |
14 | 539c9dad9675 |
15 | 26e8cb1c5103 |
hex | 136404faf1c7 |
21320301212103 has 16 divisors (see below), whose sum is σ = 29438622702720. Its totient is φ = 13715721927264.
The previous prime is 21320301212083. The next prime is 21320301212129. The reversal of 21320301212103 is 30121210302312.
It is not a de Polignac number, because 21320301212103 - 26 = 21320301212039 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21320301212103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21320301212153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 995613708 + ... + 995635121.
It is an arithmetic number, because the mean of its divisors is an integer number (1839913918920).
Almost surely, 221320301212103 is an apocalyptic number.
21320301212103 is a deficient number, since it is larger than the sum of its proper divisors (8118321490617).
21320301212103 is a wasteful number, since it uses less digits than its factorization.
21320301212103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1991248958.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 21320301212103 its reverse (30121210302312), we get a palindrome (51441511514415).
The spelling of 21320301212103 in words is "twenty-one trillion, three hundred twenty billion, three hundred one million, two hundred twelve thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •