Base | Representation |
---|---|
bin | 11101011010011000111… |
… | …10111111001011001101 |
3 | 10120121112111010221001122 |
4 | 32231030132333023031 |
5 | 113024202212143221 |
6 | 2052132524050325 |
7 | 133004423365346 |
oct | 16551436771315 |
9 | 3517474127048 |
10 | 1010600506061 |
11 | 35a658704003 |
12 | 143a400939a5 |
13 | 743b74cb033 |
14 | 36cb02450cd |
15 | 1b44c1e1eab |
hex | eb4c7bf2cd |
1010600506061 has 8 divisors (see below), whose sum is σ = 1064222666400. Its totient is φ = 957021611760.
The previous prime is 1010600506039. The next prime is 1010600506079. The reversal of 1010600506061 is 1606050060101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1010600506061 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1010600506061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010600506021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10768550 + ... + 10861991.
It is an arithmetic number, because the mean of its divisors is an integer number (133027833300).
Almost surely, 21010600506061 is an apocalyptic number.
It is an amenable number.
1010600506061 is a deficient number, since it is larger than the sum of its proper divisors (53622160339).
1010600506061 is a wasteful number, since it uses less digits than its factorization.
1010600506061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21633019.
The product of its (nonzero) digits is 1080, while the sum is 26.
Adding to 1010600506061 its reverse (1606050060101), we get a palindrome (2616650566162).
The spelling of 1010600506061 in words is "one trillion, ten billion, six hundred million, five hundred six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •