Base | Representation |
---|---|
bin | 11101100101101011010… |
… | …110001010000001011101 |
3 | 21012101100121020200212100 |
4 | 131211223112022001131 |
5 | 231303220022020331 |
6 | 4154032230555313 |
7 | 266621402043603 |
oct | 35455326120135 |
9 | 7171317220770 |
10 | 2033320501341 |
11 | 7143654616a8 |
12 | 28a0a2b08b39 |
13 | 11998383915c |
14 | 705adccd873 |
15 | 37d583a8ae6 |
hex | 1d96b58a05d |
2033320501341 has 48 divisors (see below), whose sum is σ = 3010900464000. Its totient is φ = 1321567543296.
The previous prime is 2033320501327. The next prime is 2033320501349. The reversal of 2033320501341 is 1431050233302.
2033320501341 is a `hidden beast` number, since 203 + 3 + 320 + 5 + 0 + 134 + 1 = 666.
It is not a de Polignac number, because 2033320501341 - 27 = 2033320501213 is a prime.
It is a super-2 number, since 2×20333205013412 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2033320501349) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 666879585 + ... + 666882633.
It is an arithmetic number, because the mean of its divisors is an integer number (62727093000).
Almost surely, 22033320501341 is an apocalyptic number.
It is an amenable number.
2033320501341 is a deficient number, since it is larger than the sum of its proper divisors (977579962659).
2033320501341 is a wasteful number, since it uses less digits than its factorization.
2033320501341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5730 (or 5727 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 27.
Adding to 2033320501341 its reverse (1431050233302), we get a palindrome (3464370734643).
The spelling of 2033320501341 in words is "two trillion, thirty-three billion, three hundred twenty million, five hundred one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •