Base | Representation |
---|---|
bin | 1100000111111110100101… |
… | …1101011010100111100111 |
3 | 1202012110011021100010122221 |
4 | 3001333221131122213213 |
5 | 3221404244240301043 |
6 | 44204134024533211 |
7 | 2544101400032023 |
oct | 301775135324747 |
9 | 52173137303587 |
10 | 13331200322023 |
11 | 427a8040467a1 |
12 | 15b3814021207 |
13 | 75918575701c |
14 | 34133ab87383 |
15 | 181b960208ed |
hex | c1fe975a9e7 |
13331200322023 has 8 divisors (see below), whose sum is σ = 13340341163520. Its totient is φ = 13322059904280.
The previous prime is 13331200321997. The next prime is 13331200322053. The reversal of 13331200322023 is 32022300213331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13331200322023 is a prime.
It is a super-2 number, since 2×133312003220232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13331200322053) 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, 87330558 + ... + 87483076.
It is an arithmetic number, because the mean of its divisors is an integer number (1667542645440).
Almost surely, 213331200322023 is an apocalyptic number.
13331200322023 is a deficient number, since it is larger than the sum of its proper divisors (9140841497).
13331200322023 is a wasteful number, since it uses less digits than its factorization.
13331200322023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211877.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 13331200322023 its reverse (32022300213331), we get a palindrome (45353500535354).
The spelling of 13331200322023 in words is "thirteen trillion, three hundred thirty-one billion, two hundred million, three hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •