Base | Representation |
---|---|
bin | 1001101001111001111001… |
… | …01111000011000010011111 |
3 | 2210011200000211202100221121 |
4 | 10310330330233003002133 |
5 | 10240322133312412203 |
6 | 113053223423111411 |
7 | 4320615010014220 |
oct | 464747457030237 |
9 | 83150024670847 |
10 | 21231042310303 |
11 | 684604198a331 |
12 | 246a875142567 |
13 | bb0103b95c97 |
14 | 5358333d3247 |
15 | 26c404e380bd |
hex | 134f3cbc309f |
21231042310303 has 8 divisors (see below), whose sum is σ = 24264079187072. Its totient is φ = 18198013141656.
The previous prime is 21231042310273. The next prime is 21231042310327. The reversal of 21231042310303 is 30301324013212.
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 21231042310303 - 225 = 21231008755871 is a prime.
It is a super-2 number, since 2×212310423103032 (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 (21231042910303) 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, 6339076 + ... + 9090982.
It is an arithmetic number, because the mean of its divisors is an integer number (3033009898384).
Almost surely, 221231042310303 is an apocalyptic number.
21231042310303 is a deficient number, since it is larger than the sum of its proper divisors (3033036876769).
21231042310303 is a wasteful number, since it uses less digits than its factorization.
21231042310303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3854061.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 21231042310303 its reverse (30301324013212), we get a palindrome (51532366323515).
The spelling of 21231042310303 in words is "twenty-one trillion, two hundred thirty-one billion, forty-two million, three hundred ten thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •