Base | Representation |
---|---|
bin | 101101100010110001110010… |
… | …010110011100010101101011 |
3 | 222021012200111200221102121211 |
4 | 231202301302112130111223 |
5 | 202223222010401131443 |
6 | 1550001250302413551 |
7 | 60122225421113515 |
oct | 5542616226342553 |
9 | 867180450842554 |
10 | 200302013302123 |
11 | 589056747122a7 |
12 | 1a56ba56b912b7 |
13 | 879c525241705 |
14 | 37669522c4bb5 |
15 | 18254ad38c19d |
hex | b62c7259c56b |
200302013302123 has 8 divisors (see below), whose sum is σ = 200376575750736. Its totient is φ = 200227455417600.
The previous prime is 200302013302093. The next prime is 200302013302129. The reversal of 200302013302123 is 321203310203002.
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 200302013302123 - 229 = 200301476431211 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200302013302094 and 200302013302103.
It is not an unprimeable number, because it can be changed into a prime (200302013302129) 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, 87940968 + ... + 90189898.
It is an arithmetic number, because the mean of its divisors is an integer number (25047071968842).
Almost surely, 2200302013302123 is an apocalyptic number.
200302013302123 is a deficient number, since it is larger than the sum of its proper divisors (74562448613).
200302013302123 is a wasteful number, since it uses less digits than its factorization.
200302013302123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2282045.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 200302013302123 its reverse (321203310203002), we get a palindrome (521505323505125).
The spelling of 200302013302123 in words is "two hundred trillion, three hundred two billion, thirteen million, three hundred two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •