Base | Representation |
---|---|
bin | 1001010001101111000110… |
… | …0001011110001001100001 |
3 | 1100010010202202101021222112 |
4 | 2110123301201132021201 |
5 | 2314110210414202001 |
6 | 33405542152245105 |
7 | 2101643024130200 |
oct | 224336141361141 |
9 | 40103682337875 |
10 | 10200304444001 |
11 | 3282a19a34531 |
12 | 1188a793a0795 |
13 | 58cb66570179 |
14 | 2739a981d237 |
15 | 12a4eeea2cbb |
hex | 946f185e261 |
10200304444001 has 6 divisors (see below), whose sum is σ = 11865660271650. Its totient is φ = 8743118094816.
The previous prime is 10200304443991. The next prime is 10200304444069. The reversal of 10200304444001 is 10044440300201.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 6807929858401 + 3392374585600 = 2609201^2 + 1841840^2 .
It is not a de Polignac number, because 10200304444001 - 226 = 10200237335137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10200304444801) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 104084739176 + ... + 104084739273.
It is an arithmetic number, because the mean of its divisors is an integer number (1977610045275).
Almost surely, 210200304444001 is an apocalyptic number.
It is an amenable number.
10200304444001 is a deficient number, since it is larger than the sum of its proper divisors (1665355827649).
10200304444001 is an equidigital number, since it uses as much as digits as its factorization.
10200304444001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 208169478463 (or 208169478456 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 23.
Adding to 10200304444001 its reverse (10044440300201), we get a palindrome (20244744744202).
The spelling of 10200304444001 in words is "ten trillion, two hundred billion, three hundred four million, four hundred forty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •