Base | Representation |
---|---|
bin | 101111000101101001… |
… | …0001000001110011001 |
3 | 100200000022001201120122 |
4 | 1132023102020032121 |
5 | 3124043441024423 |
6 | 114242050403025 |
7 | 10206605412422 |
oct | 1361322101631 |
9 | 320008051518 |
10 | 101121033113 |
11 | 39981206951 |
12 | 17721290475 |
13 | 96c6b45b49 |
14 | 4c73cb6649 |
15 | 296c8778c8 |
hex | 178b488399 |
101121033113 has 8 divisors (see below), whose sum is σ = 104480093376. Its totient is φ = 97815718000.
The previous prime is 101121033067. The next prime is 101121033127. The reversal of 101121033113 is 311330121101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101121033113 - 218 = 101120770969 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101121033091 and 101121033100.
It is not an unprimeable number, because it can be changed into a prime (101121053113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13432463 + ... + 13439988.
It is an arithmetic number, because the mean of its divisors is an integer number (13060011672).
Almost surely, 2101121033113 is an apocalyptic number.
It is an amenable number.
101121033113 is a deficient number, since it is larger than the sum of its proper divisors (3359060263).
101121033113 is an equidigital number, since it uses as much as digits as its factorization.
101121033113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26872575.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 101121033113 its reverse (311330121101), we get a palindrome (412451154214).
The spelling of 101121033113 in words is "one hundred one billion, one hundred twenty-one million, thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •