Base | Representation |
---|---|
bin | 1001010001111110100101… |
… | …0001110110110101010001 |
3 | 1100010112111102212022120101 |
4 | 2110133221101312311101 |
5 | 2314142214020202434 |
6 | 33411510440012401 |
7 | 2102151026125654 |
oct | 224375121666521 |
9 | 40115442768511 |
10 | 10204461100369 |
11 | 3284762296a28 |
12 | 1189839461101 |
13 | 590379781453 |
14 | 273c818b189b |
15 | 12a694d6eb14 |
hex | 947e9476d51 |
10204461100369 has 2 divisors, whose sum is σ = 10204461100370. Its totient is φ = 10204461100368.
The previous prime is 10204461100331. The next prime is 10204461100451. The reversal of 10204461100369 is 96300116440201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8544589610769 + 1659871489600 = 2923113^2 + 1288360^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10204461100369 is a prime.
It is a super-2 number, since 2×102044611003692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10204461106369) 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, 5102230550184 + 5102230550185.
It is an arithmetic number, because the mean of its divisors is an integer number (5102230550185).
Almost surely, 210204461100369 is an apocalyptic number.
It is an amenable number.
10204461100369 is a deficient number, since it is larger than the sum of its proper divisors (1).
10204461100369 is an equidigital number, since it uses as much as digits as its factorization.
10204461100369 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 37.
The spelling of 10204461100369 in words is "ten trillion, two hundred four billion, four hundred sixty-one million, one hundred thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •