Base | Representation |
---|---|
bin | 1111000000011111000011… |
… | …01100101001100000001111 |
3 | 11022211221222112112120111110 |
4 | 13200033201230221200033 |
5 | 13311201114200004403 |
6 | 154104530245023103 |
7 | 6644213554130052 |
oct | 740174154514017 |
9 | 138757875476443 |
10 | 33002020313103 |
11 | a574095118986 |
12 | 38500199b4a93 |
13 | 15551006a929a |
14 | 821440708a99 |
15 | 3c36d1a94103 |
hex | 1e03e1b2980f |
33002020313103 has 4 divisors (see below), whose sum is σ = 44002693750808. Its totient is φ = 22001346875400.
The previous prime is 33002020313063. The next prime is 33002020313117. The reversal of 33002020313103 is 30131302020033.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 33002020313103 - 214 = 33002020296719 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 33002020313103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33002020313153) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5500336718848 + ... + 5500336718853.
It is an arithmetic number, because the mean of its divisors is an integer number (11000673437702).
Almost surely, 233002020313103 is an apocalyptic number.
33002020313103 is a deficient number, since it is larger than the sum of its proper divisors (11000673437705).
33002020313103 is a wasteful number, since it uses less digits than its factorization.
33002020313103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11000673437704.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 33002020313103 its reverse (30131302020033), we get a palindrome (63133322333136).
The spelling of 33002020313103 in words is "thirty-three trillion, two billion, twenty million, three hundred thirteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •