Base | Representation |
---|---|
bin | 110100101110010111… |
… | …1111100101110001011 |
3 | 101211020212020021122200 |
4 | 1221130233330232023 |
5 | 3323341124114201 |
6 | 124003121251243 |
7 | 11115553342053 |
oct | 1513457745613 |
9 | 354225207580 |
10 | 113225223051 |
11 | 44022760a06 |
12 | 19b3aa93b23 |
13 | a8a575a305 |
14 | 56a1696563 |
15 | 2e2a329386 |
hex | 1a5cbfcb8b |
113225223051 has 6 divisors (see below), whose sum is σ = 163547544420. Its totient is φ = 75483482028.
The previous prime is 113225223049. The next prime is 113225223103. The reversal of 113225223051 is 150322522311.
113225223051 is a `hidden beast` number, since 1 + 132 + 2 + 522 + 3 + 0 + 5 + 1 = 666.
It is not a de Polignac number, because 113225223051 - 21 = 113225223049 is a prime.
It is a super-2 number, since 2×1132252230512 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (113225223851) 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 5 ways as a sum of consecutive naturals, for example, 6290290161 + ... + 6290290178.
It is an arithmetic number, because the mean of its divisors is an integer number (27257924070).
Almost surely, 2113225223051 is an apocalyptic number.
113225223051 is a deficient number, since it is larger than the sum of its proper divisors (50322321369).
113225223051 is a wasteful number, since it uses less digits than its factorization.
113225223051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12580580345 (or 12580580342 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
Adding to 113225223051 its reverse (150322522311), we get a palindrome (263547745362).
The spelling of 113225223051 in words is "one hundred thirteen billion, two hundred twenty-five million, two hundred twenty-three thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.074 sec. • engine limits •