Base | Representation |
---|---|
bin | 101111001110010000… |
… | …0011111111110111001 |
3 | 100200202102211102121121 |
4 | 1132130200133332321 |
5 | 3130141430404423 |
6 | 114330452305241 |
7 | 10220014613623 |
oct | 1363440377671 |
9 | 320672742547 |
10 | 101410013113 |
11 | 3a00a3438a2 |
12 | 177a2012221 |
13 | 9741985a26 |
14 | 4ca041bc13 |
15 | 2987e0b45d |
hex | 179c81ffb9 |
101410013113 has 8 divisors (see below), whose sum is σ = 107378225640. Its totient is φ = 95442124800.
The previous prime is 101410013099. The next prime is 101410013123. The reversal of 101410013113 is 311310014101.
It can be written as a sum of positive squares in 4 ways, for example, as 46486809664 + 54923203449 = 215608^2 + 234357^2 .
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 101410013113 - 233 = 92820078521 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101410013123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 907513 + ... + 1013113.
It is an arithmetic number, because the mean of its divisors is an integer number (13422278205).
Almost surely, 2101410013113 is an apocalyptic number.
It is an amenable number.
101410013113 is a deficient number, since it is larger than the sum of its proper divisors (5968212527).
101410013113 is a wasteful number, since it uses less digits than its factorization.
101410013113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162107.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 101410013113 its reverse (311310014101), we get a palindrome (412720027214).
The spelling of 101410013113 in words is "one hundred one billion, four hundred ten million, thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •