Base | Representation |
---|---|
bin | 11101001000110100001… |
… | …111000001011101110101 |
3 | 21002102100220020200021221 |
4 | 131020310033001131311 |
5 | 230301233231111313 |
6 | 4131505212510341 |
7 | 264443426432605 |
oct | 35106417013565 |
9 | 7072326220257 |
10 | 2002331113333 |
11 | 702202792831 |
12 | 28409477b3b1 |
13 | 116a854b1185 |
14 | 6ccb02dac05 |
15 | 37142997c8d |
hex | 1d2343c1775 |
2002331113333 has 8 divisors (see below), whose sum is σ = 2024881372800. Its totient is φ = 1979782013088.
The previous prime is 2002331113327. The next prime is 2002331113373. The reversal of 2002331113333 is 3333111332002.
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 2002331113333 - 25 = 2002331113301 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2002331113298 and 2002331113307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002331113303) 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, 3455188 + ... + 3992866.
It is an arithmetic number, because the mean of its divisors is an integer number (253110171600).
Almost surely, 22002331113333 is an apocalyptic number.
It is an amenable number.
2002331113333 is a deficient number, since it is larger than the sum of its proper divisors (22550259467).
2002331113333 is an equidigital number, since it uses as much as digits as its factorization.
2002331113333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 579611.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 2002331113333 its reverse (3333111332002), we get a palindrome (5335442445335).
The spelling of 2002331113333 in words is "two trillion, two billion, three hundred thirty-one million, one hundred thirteen thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •