Base | Representation |
---|---|
bin | 1111000110101010010001… |
… | …01010100101000110001001 |
3 | 11100121020122210100112000210 |
4 | 13203111020222211012021 |
5 | 13323140141003042023 |
6 | 154350220550151333 |
7 | 6665434604111424 |
oct | 743251052450611 |
9 | 140536583315023 |
10 | 33214201221513 |
11 | a646077773934 |
12 | 3885174952549 |
13 | 156c116491470 |
14 | 82b80c45a9bb |
15 | 3c8e9e5c1593 |
hex | 1e3548aa5189 |
33214201221513 has 8 divisors (see below), whose sum is σ = 47692186369408. Its totient is φ = 20439508443984.
The previous prime is 33214201221473. The next prime is 33214201221521. The reversal of 33214201221513 is 31512210241233.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 33214201221513 - 221 = 33214199124361 is a prime.
It is a super-2 number, since 2×332142012215132 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (33214201221563) 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, 425823092545 + ... + 425823092622.
It is an arithmetic number, because the mean of its divisors is an integer number (5961523296176).
Almost surely, 233214201221513 is an apocalyptic number.
It is an amenable number.
33214201221513 is a deficient number, since it is larger than the sum of its proper divisors (14477985147895).
33214201221513 is a wasteful number, since it uses less digits than its factorization.
33214201221513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 851646185183.
The product of its (nonzero) digits is 8640, while the sum is 30.
Adding to 33214201221513 its reverse (31512210241233), we get a palindrome (64726411462746).
The spelling of 33214201221513 in words is "thirty-three trillion, two hundred fourteen billion, two hundred one million, two hundred twenty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •