Base | Representation |
---|---|
bin | 1111000100111000100001… |
… | …10110001100011110010111 |
3 | 11100101102000222212012212220 |
4 | 13202130100312030132113 |
5 | 13321140110102401101 |
6 | 154302201241313423 |
7 | 6661143411356631 |
oct | 742342066143627 |
9 | 140342028765786 |
10 | 33153135200151 |
11 | a62219057a18a |
12 | 3875371a95873 |
13 | 1566433c1c505 |
14 | 828898191a51 |
15 | 3c75c849a636 |
hex | 1e2710d8c797 |
33153135200151 has 8 divisors (see below), whose sum is σ = 44485735555824. Its totient is φ = 21961312488960.
The previous prime is 33153135200137. The next prime is 33153135200191. The reversal of 33153135200151 is 15100253135133.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 33153135200151 - 210 = 33153135199127 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33153135200191) 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 7 ways as a sum of consecutive naturals, for example, 35194410570 + ... + 35194411511.
It is an arithmetic number, because the mean of its divisors is an integer number (5560716944478).
Almost surely, 233153135200151 is an apocalyptic number.
33153135200151 is a deficient number, since it is larger than the sum of its proper divisors (11332600355673).
33153135200151 is a wasteful number, since it uses less digits than its factorization.
33153135200151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70388822241.
The product of its (nonzero) digits is 20250, while the sum is 33.
Adding to 33153135200151 its reverse (15100253135133), we get a palindrome (48253388335284).
The spelling of 33153135200151 in words is "thirty-three trillion, one hundred fifty-three billion, one hundred thirty-five million, two hundred thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •