Base | Representation |
---|---|
bin | 1011111011010001110110… |
… | …0000011111111001110001 |
3 | 1201102121000121210021202022 |
4 | 2332310131200133321301 |
5 | 3204320441213310413 |
6 | 43520013134201225 |
7 | 2522246053511636 |
oct | 276643540377161 |
9 | 51377017707668 |
10 | 13113030213233 |
11 | 41a6228776965 |
12 | 1579487353215 |
13 | 741726bb78b2 |
14 | 33496183818d |
15 | 17b1777e0608 |
hex | bed1d81fe71 |
13113030213233 has 8 divisors (see below), whose sum is σ = 13804173602400. Its totient is φ = 12421985214528.
The previous prime is 13113030213197. The next prime is 13113030213247. The reversal of 13113030213233 is 33231203031131.
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 13113030213233 - 210 = 13113030212209 is a prime.
It is a super-2 number, since 2×131130302132332 (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 (13113030243233) 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, 24323963 + ... + 24857216.
It is an arithmetic number, because the mean of its divisors is an integer number (1725521700300).
Almost surely, 213113030213233 is an apocalyptic number.
It is an amenable number.
13113030213233 is a deficient number, since it is larger than the sum of its proper divisors (691143389167).
13113030213233 is a wasteful number, since it uses less digits than its factorization.
13113030213233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49195231.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 13113030213233 its reverse (33231203031131), we get a palindrome (46344233244364).
The spelling of 13113030213233 in words is "thirteen trillion, one hundred thirteen billion, thirty million, two hundred thirteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •