Base | Representation |
---|---|
bin | 11101001000100010011… |
… | …110100101000010101011 |
3 | 21002101121010200011211210 |
4 | 131020202132211002223 |
5 | 230300130444420243 |
6 | 4131415451324203 |
7 | 264433151300511 |
oct | 35104236450253 |
9 | 7071533604753 |
10 | 2002033201323 |
11 | 70206a605061 |
12 | 284010a50663 |
13 | 116a3886488c |
14 | 6cc8290c4b1 |
15 | 3712674c933 |
hex | 1d2227a50ab |
2002033201323 has 8 divisors (see below), whose sum is σ = 2672885328336. Its totient is φ = 1332934937600.
The previous prime is 2002033201303. The next prime is 2002033201327. The reversal of 2002033201323 is 3231023302002.
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 2002033201323 - 225 = 2001999646891 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2002033201323.
It is not an unprimeable number, because it can be changed into a prime (2002033201327) 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, 438463158 + ... + 438467723.
It is an arithmetic number, because the mean of its divisors is an integer number (334110666042).
Almost surely, 22002033201323 is an apocalyptic number.
2002033201323 is a deficient number, since it is larger than the sum of its proper divisors (670852127013).
2002033201323 is an equidigital number, since it uses as much as digits as its factorization.
2002033201323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 876931645.
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 2002033201323 its reverse (3231023302002), we get a palindrome (5233056503325).
The spelling of 2002033201323 in words is "two trillion, two billion, thirty-three million, two hundred one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •