Base | Representation |
---|---|
bin | 110100101110000011… |
… | …1011110111011011101 |
3 | 101211020010021100111120 |
4 | 1221130013132323131 |
5 | 3323330420142021 |
6 | 124002102041153 |
7 | 11115364231416 |
oct | 1513407367335 |
9 | 354203240446 |
10 | 113214615261 |
11 | 44017776140 |
12 | 19b374191b9 |
13 | a8a34b4c07 |
14 | 56a00d480d |
15 | 2e294312c6 |
hex | 1a5c1deedd |
113214615261 has 32 divisors (see below), whose sum is σ = 166236115968. Its totient is φ = 67966957440.
The previous prime is 113214615257. The next prime is 113214615263. The reversal of 113214615261 is 162516412311.
It is not a de Polignac number, because 113214615261 - 22 = 113214615257 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113214615263) 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 31 ways as a sum of consecutive naturals, for example, 2084496 + ... + 2138118.
It is an arithmetic number, because the mean of its divisors is an integer number (5194878624).
Almost surely, 2113214615261 is an apocalyptic number.
113214615261 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
113214615261 is a deficient number, since it is larger than the sum of its proper divisors (53021500707).
113214615261 is a wasteful number, since it uses less digits than its factorization.
113214615261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54241.
The product of its digits is 8640, while the sum is 33.
The spelling of 113214615261 in words is "one hundred thirteen billion, two hundred fourteen million, six hundred fifteen thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •