Base | Representation |
---|---|
bin | 1001101100000000001000… |
… | …11011000110001101001011 |
3 | 2210102120001111120221210102 |
4 | 10312000010123012031023 |
5 | 10243012233133002311 |
6 | 113150303050440015 |
7 | 4326045655201460 |
oct | 466000433061513 |
9 | 83376044527712 |
10 | 21303112000331 |
11 | 6873665398127 |
12 | 248082913300b |
13 | bb6b4b048395 |
14 | 53910cc45667 |
15 | 26e2220c543b |
hex | 1360046c634b |
21303112000331 has 8 divisors (see below), whose sum is σ = 25131781899264. Its totient is φ = 17670784147560.
The previous prime is 21303112000301. The next prime is 21303112000367. The reversal of 21303112000331 is 13300021130312.
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 21303112000331 - 210 = 21303111999307 is a prime.
It is a super-2 number, since 2×213031120003312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21303112000301) 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, 49085511305 + ... + 49085511738.
It is an arithmetic number, because the mean of its divisors is an integer number (3141472737408).
Almost surely, 221303112000331 is an apocalyptic number.
21303112000331 is a deficient number, since it is larger than the sum of its proper divisors (3828669898933).
21303112000331 is an equidigital number, since it uses as much as digits as its factorization.
21303112000331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 98171023081.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 21303112000331 its reverse (13300021130312), we get a palindrome (34603133130643).
The spelling of 21303112000331 in words is "twenty-one trillion, three hundred three billion, one hundred twelve million, three hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •