Base | Representation |
---|---|
bin | 110100101110000001… |
… | …1010001111000011001 |
3 | 101211020001012100211000 |
4 | 1221130003101320121 |
5 | 3323330124410431 |
6 | 124002022255213 |
7 | 11115351661503 |
oct | 1513403217031 |
9 | 354201170730 |
10 | 113213513241 |
11 | 44017093184 |
12 | 19b36b87509 |
13 | a8a31ba42a |
14 | 569dcc8d73 |
15 | 2e292b49e6 |
hex | 1a5c0d1e19 |
113213513241 has 32 divisors (see below), whose sum is σ = 171946252800. Its totient is φ = 73578360960.
The previous prime is 113213513167. The next prime is 113213513291. The reversal of 113213513241 is 142315312311.
113213513241 is a `hidden beast` number, since 1 + 132 + 13 + 513 + 2 + 4 + 1 = 666.
It is not a de Polignac number, because 113213513241 - 211 = 113213511193 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (113213513291) 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 31 ways as a sum of consecutive naturals, for example, 1430455 + ... + 1507523.
It is an arithmetic number, because the mean of its divisors is an integer number (5373320400).
Almost surely, 2113213513241 is an apocalyptic number.
It is an amenable number.
113213513241 is a deficient number, since it is larger than the sum of its proper divisors (58732739559).
113213513241 is a wasteful number, since it uses less digits than its factorization.
113213513241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78446 (or 78440 counting only the distinct ones).
The product of its digits is 2160, while the sum is 27.
Adding to 113213513241 its reverse (142315312311), we get a palindrome (255528825552).
The spelling of 113213513241 in words is "one hundred thirteen billion, two hundred thirteen million, five hundred thirteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •