Base | Representation |
---|---|
bin | 101111000101000111… |
… | …0100111001011100001 |
3 | 100122222001202112010010 |
4 | 1132022032213023201 |
5 | 3124024423142423 |
6 | 114240215155133 |
7 | 10206302106015 |
oct | 1361216471341 |
9 | 318861675103 |
10 | 101103334113 |
11 | 39972218381 |
12 | 17717375aa9 |
13 | 96c3289b72 |
14 | 4c717ca545 |
15 | 296b02d693 |
hex | 178a3a72e1 |
101103334113 has 8 divisors (see below), whose sum is σ = 134820726048. Its totient is φ = 67394082464.
The previous prime is 101103334093. The next prime is 101103334153. The reversal of 101103334113 is 311433301101.
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 101103334113 - 29 = 101103333601 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101103334113.
It is not an unprimeable number, because it can be changed into a prime (101103334153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2006031 + ... + 2055812.
It is an arithmetic number, because the mean of its divisors is an integer number (16852590756).
Almost surely, 2101103334113 is an apocalyptic number.
It is an amenable number.
101103334113 is a deficient number, since it is larger than the sum of its proper divisors (33717391935).
101103334113 is an equidigital number, since it uses as much as digits as its factorization.
101103334113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4070143.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 101103334113 its reverse (311433301101), we get a palindrome (412536635214).
The spelling of 101103334113 in words is "one hundred one billion, one hundred three million, three hundred thirty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •