Base | Representation |
---|---|
bin | 1111000100000010011111… |
… | …00010001010010110110101 |
3 | 11100021122011000200011101112 |
4 | 13202001033202022112311 |
5 | 13320201200232022013 |
6 | 154241002303004405 |
7 | 6656065424424641 |
oct | 742011742122665 |
9 | 140248130604345 |
10 | 33124122142133 |
11 | a610952450290 |
12 | 386b815599705 |
13 | 156378c171b69 |
14 | 827304c55c21 |
15 | 3c697b323ba8 |
hex | 1e204f88a5b5 |
33124122142133 has 32 divisors (see below), whose sum is σ = 37766455234560. Its totient is φ = 28757809650240.
The previous prime is 33124122142127. The next prime is 33124122142249.
33124122142133 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 33124122142133 - 228 = 33123853706677 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 33124122142133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33124122144133) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1099248935 + ... + 1099279067.
It is an arithmetic number, because the mean of its divisors is an integer number (1180201726080).
Almost surely, 233124122142133 is an apocalyptic number.
It is an amenable number.
33124122142133 is a deficient number, since it is larger than the sum of its proper divisors (4642333092427).
33124122142133 is a wasteful number, since it uses less digits than its factorization.
33124122142133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36929.
The product of its digits is 20736, while the sum is 32.
It can be divided in two parts, 3312412 and 2142133, that added together give a palindrome (5454545).
The spelling of 33124122142133 in words is "thirty-three trillion, one hundred twenty-four billion, one hundred twenty-two million, one hundred forty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •