Base | Representation |
---|---|
bin | 11101100101100100010… |
… | …010000111001000011101 |
3 | 21012101001100021020011002 |
4 | 131211210102013020131 |
5 | 231302444203003123 |
6 | 4154012355040045 |
7 | 266615432565053 |
oct | 35454422071035 |
9 | 7171040236132 |
10 | 2033202000413 |
11 | 714304584151 |
12 | 28a06b2a0025 |
13 | 11996511866c |
14 | 7059c2841d3 |
15 | 37d4cc9c528 |
hex | 1d96448721d |
2033202000413 has 16 divisors (see below), whose sum is σ = 2088753924096. Its totient is φ = 1977936591360.
The previous prime is 2033202000409. The next prime is 2033202000439. The reversal of 2033202000413 is 3140002023302.
It is a cyclic number.
It is not a de Polignac number, because 2033202000413 - 22 = 2033202000409 is a prime.
It is a super-3 number, since 3×20332020004133 (a number of 38 digits) contains 333 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 (2033202030413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 73114970 + ... + 73142772.
It is an arithmetic number, because the mean of its divisors is an integer number (130547120256).
Almost surely, 22033202000413 is an apocalyptic number.
It is an amenable number.
2033202000413 is a deficient number, since it is larger than the sum of its proper divisors (55551923683).
2033202000413 is a wasteful number, since it uses less digits than its factorization.
2033202000413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32884.
The product of its (nonzero) digits is 864, while the sum is 20.
Adding to 2033202000413 its reverse (3140002023302), we get a palindrome (5173204023715).
The spelling of 2033202000413 in words is "two trillion, thirty-three billion, two hundred two million, four hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •