Base | Representation |
---|---|
bin | 1001101100100000001001… |
… | …11110101110100111110111 |
3 | 2210111012102110010021201101 |
4 | 10312100010332232213313 |
5 | 10243302434102210403 |
6 | 113202224451110531 |
7 | 4330224640106620 |
oct | 466200476564767 |
9 | 83435373107641 |
10 | 21320301210103 |
11 | 687a986239915 |
12 | 24840258a2447 |
13 | bb865a2b861c |
14 | 539c9dad8a47 |
15 | 26e8cb1c471d |
hex | 136404fae9f7 |
21320301210103 has 8 divisors (see below), whose sum is σ = 24366091669920. Its totient is φ = 18274519036320.
The previous prime is 21320301209983. The next prime is 21320301210163. The reversal of 21320301210103 is 30101210302312.
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 21320301210103 - 213 = 21320301201911 is a prime.
It is a super-2 number, since 2×213203012101032 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21320301210163) 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, 5095053 + ... + 8282521.
It is an arithmetic number, because the mean of its divisors is an integer number (3045761458740).
Almost surely, 221320301210103 is an apocalyptic number.
21320301210103 is a deficient number, since it is larger than the sum of its proper divisors (3045790459817).
21320301210103 is an equidigital number, since it uses as much as digits as its factorization.
21320301210103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4143017.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 21320301210103 its reverse (30101210302312), we get a palindrome (51421511512415).
The spelling of 21320301210103 in words is "twenty-one trillion, three hundred twenty billion, three hundred one million, two hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •