Base | Representation |
---|---|
bin | 101101100100011010010111… |
… | …111000000011100010000111 |
3 | 222021121102100222210101020212 |
4 | 231210122113320003202013 |
5 | 202232042002334120403 |
6 | 1550125021445550035 |
7 | 60133312324345616 |
oct | 5544322770034207 |
9 | 867542328711225 |
10 | 200414312020103 |
11 | 58949261388235 |
12 | 1a58977771531b |
13 | 87a9cb0a5506c |
14 | 376c1668c187d |
15 | 18283821a14d8 |
hex | b64697e03887 |
200414312020103 has 2 divisors, whose sum is σ = 200414312020104. Its totient is φ = 200414312020102.
The previous prime is 200414312020019. The next prime is 200414312020243. The reversal of 200414312020103 is 301020213414002.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 200414312020103 - 210 = 200414312019079 is a prime.
It is a super-2 number, since 2×2004143120201032 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200414312028103) 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 as a sum of consecutive naturals, namely, 100207156010051 + 100207156010052.
It is an arithmetic number, because the mean of its divisors is an integer number (100207156010052).
Almost surely, 2200414312020103 is an apocalyptic number.
200414312020103 is a deficient number, since it is larger than the sum of its proper divisors (1).
200414312020103 is an equidigital number, since it uses as much as digits as its factorization.
200414312020103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 200414312020103 its reverse (301020213414002), we get a palindrome (501434525434105).
The spelling of 200414312020103 in words is "two hundred trillion, four hundred fourteen billion, three hundred twelve million, twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •