Base | Representation |
---|---|
bin | 10110111111010110111111… |
… | …000010011110101000010101 |
3 | 111021000010020112200011220002 |
4 | 112333112333002132220111 |
5 | 101223100342213310031 |
6 | 555013433244021045 |
7 | 30204013405136504 |
oct | 2677267702365025 |
9 | 437003215604802 |
10 | 101111030213141 |
11 | 2a242a466615a3 |
12 | b40bbb3531785 |
13 | 4455963196850 |
14 | 1ad7b2b1b283b |
15 | ba51e37cbccb |
hex | 5bf5bf09ea15 |
101111030213141 has 128 divisors (see below), whose sum is σ = 116917214400000. Its totient is φ = 86782839091200.
The previous prime is 101111030213111. The next prime is 101111030213227. The reversal of 101111030213141 is 141312030111101.
It is not a de Polignac number, because 101111030213141 - 26 = 101111030213077 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 (101111030213101) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 126864529355 + ... + 126864530151.
It is an arithmetic number, because the mean of its divisors is an integer number (913415737500).
Almost surely, 2101111030213141 is an apocalyptic number.
It is an amenable number.
101111030213141 is a deficient number, since it is larger than the sum of its proper divisors (15806184186859).
101111030213141 is a wasteful number, since it uses less digits than its factorization.
101111030213141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1527.
The product of its (nonzero) digits is 72, while the sum is 20.
Adding to 101111030213141 its reverse (141312030111101), we get a palindrome (242423060324242).
The spelling of 101111030213141 in words is "one hundred one trillion, one hundred eleven billion, thirty million, two hundred thirteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •