Base | Representation |
---|---|
bin | 11101011000110001110… |
… | …11100011110000001001 |
3 | 10120112022012122011111022 |
4 | 32230120323203300021 |
5 | 113020414302040211 |
6 | 2051511025442225 |
7 | 132644121552122 |
oct | 16543073436011 |
9 | 3515265564438 |
10 | 1009735580681 |
11 | 35a254458843 |
12 | 14383a4a0375 |
13 | 742aa265379 |
14 | 36c2b419049 |
15 | 1b3eb2e2bdb |
hex | eb18ee3c09 |
1009735580681 has 2 divisors, whose sum is σ = 1009735580682. Its totient is φ = 1009735580680.
The previous prime is 1009735580657. The next prime is 1009735580741. The reversal of 1009735580681 is 1860855379001.
1009735580681 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 853618927225 + 156116653456 = 923915^2 + 395116^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1009735580681 is a prime.
It is a super-2 number, since 2×10097355806812 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1009735580621) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 504867790340 + 504867790341.
It is an arithmetic number, because the mean of its divisors is an integer number (504867790341).
Almost surely, 21009735580681 is an apocalyptic number.
It is an amenable number.
1009735580681 is a deficient number, since it is larger than the sum of its proper divisors (1).
1009735580681 is an equidigital number, since it uses as much as digits as its factorization.
1009735580681 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1814400, while the sum is 53.
The spelling of 1009735580681 in words is "one trillion, nine billion, seven hundred thirty-five million, five hundred eighty thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •