Base | Representation |
---|---|
bin | 1001101100110010101001… |
… | …11101111101110111111111 |
3 | 2210112011001121202200221101 |
4 | 10312121110331331313333 |
5 | 10243433304134403203 |
6 | 113210550202313531 |
7 | 4331026030011100 |
oct | 466312475756777 |
9 | 83464047680841 |
10 | 21330233122303 |
11 | 6884112579516 |
12 | 2485b37ab88a7 |
13 | bb9580b56751 |
14 | 53a562bb63a7 |
15 | 26ecad0d341d |
hex | 136654f7ddff |
21330233122303 has 6 divisors (see below), whose sum is σ = 24812720162736. Its totient is φ = 18283056961932.
The previous prime is 21330233122249. The next prime is 21330233122343. The reversal of 21330233122303 is 30322133203312.
It is not a de Polignac number, because 21330233122303 - 213 = 21330233114111 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 (21330233122343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 217655439975 + ... + 217655440072.
It is an arithmetic number, because the mean of its divisors is an integer number (4135453360456).
Almost surely, 221330233122303 is an apocalyptic number.
21330233122303 is a deficient number, since it is larger than the sum of its proper divisors (3482487040433).
21330233122303 is an equidigital number, since it uses as much as digits as its factorization.
21330233122303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 435310880061 (or 435310880054 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 28.
Adding to 21330233122303 its reverse (30322133203312), we get a palindrome (51652366325615).
The spelling of 21330233122303 in words is "twenty-one trillion, three hundred thirty billion, two hundred thirty-three million, one hundred twenty-two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •