Base | Representation |
---|---|
bin | 11101001000100010011… |
… | …110100101100010000001 |
3 | 21002101121010200021121002 |
4 | 131020202132211202001 |
5 | 230300131000001304 |
6 | 4131415451341345 |
7 | 264433151306405 |
oct | 35104236454201 |
9 | 7071533607532 |
10 | 2002033203329 |
11 | 70206a606615 |
12 | 284010a51855 |
13 | 116a38865773 |
14 | 6cc8290d105 |
15 | 3712674d31e |
hex | 1d2227a5881 |
2002033203329 has 16 divisors (see below), whose sum is σ = 2102214451200. Its totient is φ = 1903934761344.
The previous prime is 2002033203301. The next prime is 2002033203337. The reversal of 2002033203329 is 9233023302002.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 2002033203329 - 212 = 2002033199233 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2002033203349) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19021952 + ... + 19126910.
It is an arithmetic number, because the mean of its divisors is an integer number (131388403200).
Almost surely, 22002033203329 is an apocalyptic number.
2002033203329 is a gapful number since it is divisible by the number (29) formed by its first and last digit.
It is an amenable number.
2002033203329 is a deficient number, since it is larger than the sum of its proper divisors (100181247871).
2002033203329 is a wasteful number, since it uses less digits than its factorization.
2002033203329 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114872.
The product of its (nonzero) digits is 11664, while the sum is 29.
The spelling of 2002033203329 in words is "two trillion, two billion, thirty-three million, two hundred three thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •