Base | Representation |
---|---|
bin | 1111000000011111011000… |
… | …11010100001101110010101 |
3 | 11022211222110001212022020122 |
4 | 13200033230122201232111 |
5 | 13311202001212041041 |
6 | 154105000150441325 |
7 | 6644221166320130 |
oct | 740175432415625 |
9 | 138758401768218 |
10 | 33002200112021 |
11 | a574177663528 |
12 | 385006a063245 |
13 | 155512ba0c78a |
14 | 82145a54d217 |
15 | 3c36e275cc4b |
hex | 1e03ec6a1b95 |
33002200112021 has 8 divisors (see below), whose sum is σ = 37781053625280. Its totient is φ = 28239409973088.
The previous prime is 33002200111973. The next prime is 33002200112029. The reversal of 33002200112021 is 12021100220033.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-33002200112021 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33002200112029) 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, 4015839176 + ... + 4015847393.
It is an arithmetic number, because the mean of its divisors is an integer number (4722631703160).
Almost surely, 233002200112021 is an apocalyptic number.
It is an amenable number.
33002200112021 is a deficient number, since it is larger than the sum of its proper divisors (4778853513259).
33002200112021 is an equidigital number, since it uses as much as digits as its factorization.
33002200112021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8031687163.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 33002200112021 its reverse (12021100220033), we get a palindrome (45023300332054).
The spelling of 33002200112021 in words is "thirty-three trillion, two billion, two hundred million, one hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •