Base | Representation |
---|---|
bin | 11110110110011111110… |
… | …10001111011010010001 |
3 | 10202100011201021212202002 |
4 | 33123033322033122101 |
5 | 114331440311343001 |
6 | 2130551424403345 |
7 | 136405013142245 |
oct | 17331772173221 |
9 | 3670151255662 |
10 | 1060050106001 |
11 | 379623716377 |
12 | 151540776555 |
13 | 78c6821a443 |
14 | 39441820425 |
15 | 1c8935b546b |
hex | f6cfe8f691 |
1060050106001 has 4 divisors (see below), whose sum is σ = 1061855984112. Its totient is φ = 1058244227892.
The previous prime is 1060050105923. The next prime is 1060050106007. The reversal of 1060050106001 is 1006010500601.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1060050106001 - 234 = 1042870236817 is a prime.
It is a super-2 number, since 2×10600501060012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1060050106007) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 902938175 + ... + 902939348.
It is an arithmetic number, because the mean of its divisors is an integer number (265463996028).
Almost surely, 21060050106001 is an apocalyptic number.
It is an amenable number.
1060050106001 is a deficient number, since it is larger than the sum of its proper divisors (1805878111).
1060050106001 is an equidigital number, since it uses as much as digits as its factorization.
1060050106001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1805878110.
The product of its (nonzero) digits is 180, while the sum is 20.
Adding to 1060050106001 its reverse (1006010500601), we get a palindrome (2066060606602).
The spelling of 1060050106001 in words is "one trillion, sixty billion, fifty million, one hundred six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.160 sec. • engine limits •