Base | Representation |
---|---|
bin | 1001101011111111111100… |
… | …10111010000101011000101 |
3 | 2210102112210102021122010222 |
4 | 10311333332113100223011 |
5 | 10243012031121100313 |
6 | 113150245015354125 |
7 | 4326043312055423 |
oct | 465777627205305 |
9 | 83375712248128 |
10 | 21303010331333 |
11 | 6873612a66765 |
12 | 24807bb082945 |
13 | bb6b32c6c003 |
14 | 5390dd53c113 |
15 | 26e2181e1208 |
hex | 135ffe5d0ac5 |
21303010331333 has 4 divisors (see below), whose sum is σ = 21303024872640. Its totient is φ = 21302995790028.
The previous prime is 21303010331191. The next prime is 21303010331341. The reversal of 21303010331333 is 33313301030312.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 21303010331333 - 222 = 21303006137029 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21303010331363) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4791335 + ... + 8097092.
It is an arithmetic number, because the mean of its divisors is an integer number (5325756218160).
Almost surely, 221303010331333 is an apocalyptic number.
It is an amenable number.
21303010331333 is a deficient number, since it is larger than the sum of its proper divisors (14541307).
21303010331333 is a wasteful number, since it uses less digits than its factorization.
21303010331333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14541306.
The product of its (nonzero) digits is 4374, while the sum is 26.
Adding to 21303010331333 its reverse (33313301030312), we get a palindrome (54616311361645).
The spelling of 21303010331333 in words is "twenty-one trillion, three hundred three billion, ten million, three hundred thirty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •