Base | Representation |
---|---|
bin | 101101011111111001110000… |
… | …010111000001001011111001 |
3 | 222020111210110111002220002110 |
4 | 231133321300113001023321 |
5 | 202212002313304344001 |
6 | 1545330410400122533 |
7 | 60102031566513330 |
oct | 5537716027011371 |
9 | 866453414086073 |
10 | 200104411403001 |
11 | 58839893586856 |
12 | 1a5396aa606449 |
13 | 87869c39c4951 |
14 | 375b1688cad17 |
15 | 18202957163d6 |
hex | b5fe705c12f9 |
200104411403001 has 16 divisors (see below), whose sum is σ = 305033983488000. Its totient is φ = 114303012081168.
The previous prime is 200104411402991. The next prime is 200104411403087. The reversal of 200104411403001 is 100304114401002.
It is not a de Polignac number, because 200104411403001 - 214 = 200104411386617 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (200104421403001) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1765186281 + ... + 1765299638.
It is an arithmetic number, because the mean of its divisors is an integer number (19064623968000).
Almost surely, 2200104411403001 is an apocalyptic number.
200104411403001 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
200104411403001 is a deficient number, since it is larger than the sum of its proper divisors (104929572084999).
200104411403001 is a wasteful number, since it uses less digits than its factorization.
200104411403001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3530488628.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 200104411403001 its reverse (100304114401002), we get a palindrome (300408525804003).
The spelling of 200104411403001 in words is "two hundred trillion, one hundred four billion, four hundred eleven million, four hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.287 sec. • engine limits •