Base | Representation |
---|---|
bin | 1111000001000000110001… |
… | …00001111110110110001001 |
3 | 11022220200200221112200200101 |
4 | 13200200120201332312021 |
5 | 13312000201223224001 |
6 | 154121122255005401 |
7 | 6645424234064221 |
oct | 740403041766611 |
9 | 138820627480611 |
10 | 33020120133001 |
11 | a580832a89521 |
12 | 385362b509861 |
13 | 1556a264b93a1 |
14 | 82227a4bb081 |
15 | 3c3de0ab8a01 |
hex | 1e081887ed89 |
33020120133001 has 8 divisors (see below), whose sum is σ = 34526528625024. Its totient is φ = 31519607565600.
The previous prime is 33020120132897. The next prime is 33020120133029. The reversal of 33020120133001 is 10033102102033.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 33020120133001 - 231 = 33017972649353 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 33020120133001.
It is not an unprimeable number, because it can be changed into a prime (33020120133701) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1473969700 + ... + 1473992101.
It is an arithmetic number, because the mean of its divisors is an integer number (4315816078128).
Almost surely, 233020120133001 is an apocalyptic number.
It is an amenable number.
33020120133001 is a deficient number, since it is larger than the sum of its proper divisors (1506408492023).
33020120133001 is a wasteful number, since it uses less digits than its factorization.
33020120133001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2947962311.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 33020120133001 its reverse (10033102102033), we get a palindrome (43053222235034).
The spelling of 33020120133001 in words is "thirty-three trillion, twenty billion, one hundred twenty million, one hundred thirty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •