Base | Representation |
---|---|
bin | 1001100110001011110001… |
… | …11011111101101010010111 |
3 | 2202201110001112010021221011 |
4 | 10303011320323331222113 |
5 | 10231223330021411411 |
6 | 112514402221433051 |
7 | 4305441023314210 |
oct | 463057073755227 |
9 | 82643045107834 |
10 | 21103203310231 |
11 | 67a6900122459 |
12 | 2449b3810b787 |
13 | ba103c919443 |
14 | 52d586d32407 |
15 | 268e21b8ac21 |
hex | 133178efda97 |
21103203310231 has 8 divisors (see below), whose sum is σ = 24119486765984. Its totient is φ = 18087304885920.
The previous prime is 21103203310157. The next prime is 21103203310283. The reversal of 21103203310231 is 13201330230112.
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 21103203310231 - 213 = 21103203302039 is a prime.
It is a super-2 number, since 2×211032033102312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21103203310331) 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, 96140400 + ... + 96359653.
It is an arithmetic number, because the mean of its divisors is an integer number (3014935845748).
Almost surely, 221103203310231 is an apocalyptic number.
21103203310231 is a deficient number, since it is larger than the sum of its proper divisors (3016283455753).
21103203310231 is a wasteful number, since it uses less digits than its factorization.
21103203310231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192515721.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 21103203310231 its reverse (13201330230112), we get a palindrome (34304533540343).
The spelling of 21103203310231 in words is "twenty-one trillion, one hundred three billion, two hundred three million, three hundred ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •