Base | Representation |
---|---|
bin | 1001101100010000101100… |
… | …10001001000101000110101 |
3 | 2210110102000000101211210022 |
4 | 10312020112101020220311 |
5 | 10243133434314011313 |
6 | 113154333115334525 |
7 | 4326512155130063 |
oct | 466102621105065 |
9 | 83412000354708 |
10 | 21312001313333 |
11 | 68774071585a5 |
12 | 24824aa151445 |
13 | bb79368b26c3 |
14 | 539713687033 |
15 | 26e5926dac08 |
hex | 136216448a35 |
21312001313333 has 4 divisors (see below), whose sum is σ = 21315069119520. Its totient is φ = 21308933507148.
The previous prime is 21312001313299. The next prime is 21312001313417. The reversal of 21312001313333 is 33331310021312.
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 21312001313333 - 210 = 21312001312309 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 (21312001313233) 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, 1533892673 + ... + 1533906566.
It is an arithmetic number, because the mean of its divisors is an integer number (5328767279880).
Almost surely, 221312001313333 is an apocalyptic number.
It is an amenable number.
21312001313333 is a deficient number, since it is larger than the sum of its proper divisors (3067806187).
21312001313333 is an equidigital number, since it uses as much as digits as its factorization.
21312001313333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3067806186.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 21312001313333 its reverse (33331310021312), we get a palindrome (54643311334645).
The spelling of 21312001313333 in words is "twenty-one trillion, three hundred twelve billion, one million, three hundred thirteen thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •