Base | Representation |
---|---|
bin | 1001101001111110000111… |
… | …11001111110101000101101 |
3 | 2210011212212220000000121002 |
4 | 10310333003321332220231 |
5 | 10240341304341200023 |
6 | 113054240433450045 |
7 | 4321025134633064 |
oct | 464770371765055 |
9 | 83155786000532 |
10 | 21233310100013 |
11 | 6846aa6000300 |
12 | 246b1a8710925 |
13 | bb03a597109b |
14 | 5359aa6791db |
15 | 26c4d9095b28 |
hex | 134fc3e7ea2d |
21233310100013 has 24 divisors (see below), whose sum is σ = 24229204456800. Its totient is φ = 18571530811680.
The previous prime is 21233310100003. The next prime is 21233310100033. The reversal of 21233310100013 is 31000101333212.
It is not a de Polignac number, because 21233310100013 - 24 = 21233310099997 is a prime.
It is a super-3 number, since 3×212333101000133 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21233310100003) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9697943 + ... + 11684036.
It is an arithmetic number, because the mean of its divisors is an integer number (1009550185700).
Almost surely, 221233310100013 is an apocalyptic number.
It is an amenable number.
21233310100013 is a deficient number, since it is larger than the sum of its proper divisors (2995894356787).
21233310100013 is a wasteful number, since it uses less digits than its factorization.
21233310100013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21382313 (or 21382302 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 21233310100013 its reverse (31000101333212), we get a palindrome (52233411433225).
The spelling of 21233310100013 in words is "twenty-one trillion, two hundred thirty-three billion, three hundred ten million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •