Base | Representation |
---|---|
bin | 11110111000011100111… |
… | …11101001101111111111 |
3 | 10202102212220001010120012 |
4 | 33130032133221233333 |
5 | 114341113111204412 |
6 | 2131243533413435 |
7 | 136443023016101 |
oct | 17341637515777 |
9 | 3672786033505 |
10 | 1061100100607 |
11 | 37a012386908 |
12 | 15179433a27b |
13 | 790a4910421 |
14 | 39501063571 |
15 | 1c90586ec22 |
hex | f70e7e9bff |
1061100100607 has 2 divisors, whose sum is σ = 1061100100608. Its totient is φ = 1061100100606.
The previous prime is 1061100100561. The next prime is 1061100100639. The reversal of 1061100100607 is 7060010011601.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1061100100607 - 210 = 1061100099583 is a prime.
It is a super-2 number, since 2×10611001006072 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1061100100657) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 530550050303 + 530550050304.
It is an arithmetic number, because the mean of its divisors is an integer number (530550050304).
Almost surely, 21061100100607 is an apocalyptic number.
1061100100607 is a deficient number, since it is larger than the sum of its proper divisors (1).
1061100100607 is an equidigital number, since it uses as much as digits as its factorization.
1061100100607 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 23.
The spelling of 1061100100607 in words is "one trillion, sixty-one billion, one hundred million, one hundred thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •