Base | Representation |
---|---|
bin | 11101101111000110000… |
… | …111011011010010001101 |
3 | 21020100110101021011012210 |
4 | 131233012013123102031 |
5 | 231434422411114013 |
6 | 4202423523221033 |
7 | 300430116321120 |
oct | 35570607332215 |
9 | 7210411234183 |
10 | 2043433301133 |
11 | 71868490a884 |
12 | 290045817779 |
13 | 11a9059cc163 |
14 | 70c8d0163b7 |
15 | 3824b0e8cc3 |
hex | 1dbc61db48d |
2043433301133 has 32 divisors (see below), whose sum is σ = 3217977568512. Its totient is φ = 1129114828800.
The previous prime is 2043433301099. The next prime is 2043433301137. The reversal of 2043433301133 is 3311033343402.
It is not a de Polignac number, because 2043433301133 - 26 = 2043433301069 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2043433301133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2043433301137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10404148 + ... + 10598733.
It is an arithmetic number, because the mean of its divisors is an integer number (100561799016).
Almost surely, 22043433301133 is an apocalyptic number.
It is an amenable number.
2043433301133 is a deficient number, since it is larger than the sum of its proper divisors (1174544267379).
2043433301133 is a wasteful number, since it uses less digits than its factorization.
2043433301133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21003045.
The product of its (nonzero) digits is 23328, while the sum is 30.
Adding to 2043433301133 its reverse (3311033343402), we get a palindrome (5354466644535).
The spelling of 2043433301133 in words is "two trillion, forty-three billion, four hundred thirty-three million, three hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •