Base | Representation |
---|---|
bin | 11101010000010000011… |
… | …110100001001101011101 |
3 | 21010011222201212121002111 |
4 | 131100100132201031131 |
5 | 230414114202132313 |
6 | 4135310114354021 |
7 | 265145426444035 |
oct | 35202036411535 |
9 | 7104881777074 |
10 | 2010321130333 |
11 | 70563296186a |
12 | 28574458b911 |
13 | 11775993a399 |
14 | 6d42b5268c5 |
15 | 3745e17043d |
hex | 1d4107a135d |
2010321130333 has 8 divisors (see below), whose sum is σ = 2038096742528. Its totient is φ = 1982551922784.
The previous prime is 2010321130291. The next prime is 2010321130369. The reversal of 2010321130333 is 3330311230102.
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 2010321130333 - 217 = 2010320999261 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2010321130373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 967335 + ... + 2226292.
It is an arithmetic number, because the mean of its divisors is an integer number (254762092816).
Almost surely, 22010321130333 is an apocalyptic number.
It is an amenable number.
2010321130333 is a deficient number, since it is larger than the sum of its proper divisors (27775612195).
2010321130333 is an equidigital number, since it uses as much as digits as its factorization.
2010321130333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3202323.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 2010321130333 its reverse (3330311230102), we get a palindrome (5340632360435).
The spelling of 2010321130333 in words is "two trillion, ten billion, three hundred twenty-one million, one hundred thirty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •