Base | Representation |
---|---|
bin | 11101000111100101000… |
… | …00011110001001110101 |
3 | 10112122110122011102110021 |
4 | 32203302200132021311 |
5 | 112343011224323221 |
6 | 2043342424525141 |
7 | 132166230163456 |
oct | 16436240361165 |
9 | 3478418142407 |
10 | 1000501011061 |
11 | 356345812a22 |
12 | 141aa19207b1 |
13 | 73468015ba6 |
14 | 365d2bc312d |
15 | 1b05a72e041 |
hex | e8f281e275 |
1000501011061 has 16 divisors (see below), whose sum is σ = 1015372512000. Its totient is φ = 985725232128.
The previous prime is 1000501011049. The next prime is 1000501011077. The reversal of 1000501011061 is 1601101050001.
1000501011061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 1000501011061 - 29 = 1000501010549 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000501011091) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 107773126 + ... + 107782408.
It is an arithmetic number, because the mean of its divisors is an integer number (63460782000).
Almost surely, 21000501011061 is an apocalyptic number.
It is an amenable number.
1000501011061 is a deficient number, since it is larger than the sum of its proper divisors (14871500939).
1000501011061 is an equidigital number, since it uses as much as digits as its factorization.
1000501011061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14268.
The product of its (nonzero) digits is 30, while the sum is 16.
Adding to 1000501011061 its reverse (1601101050001), we get a palindrome (2601602061062).
It can be divided in two parts, 100050 and 1011061, that added together give a palindrome (1111111).
The spelling of 1000501011061 in words is "one trillion, five hundred one million, eleven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •