Base | Representation |
---|---|
bin | 101111000101101001… |
… | …0000110000001110001 |
3 | 100200000022001021020022 |
4 | 1132023102012001301 |
5 | 3124043440232423 |
6 | 114242050253225 |
7 | 10206605344244 |
oct | 1361322060161 |
9 | 320008037208 |
10 | 101121024113 |
11 | 3998120010a |
12 | 17721287215 |
13 | 96c6b41a15 |
14 | 4c73cb325b |
15 | 296c874dc8 |
hex | 178b486071 |
101121024113 has 4 divisors (see below), whose sum is σ = 101124538020. Its totient is φ = 101117510208.
The previous prime is 101121024107. The next prime is 101121024131. The reversal of 101121024113 is 311420121101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 39534164224 + 61586859889 = 198832^2 + 248167^2 .
It is a cyclic number.
It is not a de Polignac number, because 101121024113 - 218 = 101120761969 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101121024091 and 101121024100.
It is not an unprimeable number, because it can be changed into a prime (101121024313) 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, 1713428 + ... + 1771461.
It is an arithmetic number, because the mean of its divisors is an integer number (25281134505).
Almost surely, 2101121024113 is an apocalyptic number.
It is an amenable number.
101121024113 is a deficient number, since it is larger than the sum of its proper divisors (3513907).
101121024113 is an equidigital number, since it uses as much as digits as its factorization.
101121024113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3513906.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 101121024113 its reverse (311420121101), we get a palindrome (412541145214).
The spelling of 101121024113 in words is "one hundred one billion, one hundred twenty-one million, twenty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •