Base | Representation |
---|---|
bin | 101101100001010101100110… |
… | …000000100110100010010011 |
3 | 222020212012222211100100220210 |
4 | 231201111212000212202103 |
5 | 202220111242113033243 |
6 | 1545443555411335203 |
7 | 60112122343003104 |
oct | 5541254600464223 |
9 | 866765884310823 |
10 | 200203022002323 |
11 | 5887769670262a |
12 | 1a55482abb1503 |
13 | 87930aa6c71c2 |
14 | 3761c411d83ab |
15 | 1822b179a1933 |
hex | b61566026893 |
200203022002323 has 8 divisors (see below), whose sum is σ = 280986697547200. Its totient is φ = 126444013896168.
The previous prime is 200203022002301. The next prime is 200203022002429. The reversal of 200203022002323 is 323200220302002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200203022002323 - 210 = 200203022001299 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 200203022002323.
It is not an unprimeable number, because it can be changed into a prime (200203022009323) 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, 1756166859613 + ... + 1756166859726.
It is an arithmetic number, because the mean of its divisors is an integer number (35123337193400).
Almost surely, 2200203022002323 is an apocalyptic number.
200203022002323 is a deficient number, since it is larger than the sum of its proper divisors (80783675544877).
200203022002323 is a wasteful number, since it uses less digits than its factorization.
200203022002323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3512333719361.
The product of its (nonzero) digits is 1728, while the sum is 21.
Adding to 200203022002323 its reverse (323200220302002), we get a palindrome (523403242304325).
The spelling of 200203022002323 in words is "two hundred trillion, two hundred three billion, twenty-two million, two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •