Base | Representation |
---|---|
bin | 1011101010100111111… |
… | …1011000111000101011 |
3 | 201011022122110101002122 |
4 | 2322221333120320223 |
5 | 11240430114241443 |
6 | 232023310021455 |
7 | 20323414551050 |
oct | 2725177307053 |
9 | 634278411078 |
10 | 200420462123 |
11 | 77aa8142662 |
12 | 32a144a788b |
13 | 15b9047632b |
14 | 99b3c91027 |
15 | 533032a968 |
hex | 2ea9fd8e2b |
200420462123 has 8 divisors (see below), whose sum is σ = 229057908960. Its totient is φ = 171784503360.
The previous prime is 200420462119. The next prime is 200420462131. The reversal of 200420462123 is 321264024002.
It is a happy number.
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 200420462123 - 22 = 200420462119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200420462092 and 200420462101.
It is not an unprimeable number, because it can be changed into a prime (200420462173) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 66698 + ... + 636623.
It is an arithmetic number, because the mean of its divisors is an integer number (28632238620).
Almost surely, 2200420462123 is an apocalyptic number.
200420462123 is a deficient number, since it is larger than the sum of its proper divisors (28637446837).
200420462123 is an equidigital number, since it uses as much as digits as its factorization.
200420462123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 744037.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 200420462123 its reverse (321264024002), we get a palindrome (521684486125).
The spelling of 200420462123 in words is "two hundred billion, four hundred twenty million, four hundred sixty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •