Base | Representation |
---|---|
bin | 110100101110100001… |
… | …0100110101000100011 |
3 | 101211021012102201211120 |
4 | 1221131002212220203 |
5 | 3323343402111230 |
6 | 124003414143323 |
7 | 11115643040304 |
oct | 1513502465043 |
9 | 354235381746 |
10 | 113230113315 |
11 | 440254a1050 |
12 | 19b40651b43 |
13 | a8a6780167 |
14 | 56a21aa7ab |
15 | 2e2a993310 |
hex | 1a5d0a6a23 |
113230113315 has 32 divisors (see below), whose sum is σ = 206230980096. Its totient is φ = 52512514560.
The previous prime is 113230113301. The next prime is 113230113319. The reversal of 113230113315 is 513311032311.
It is a happy number.
It is not a de Polignac number, because 113230113315 - 24 = 113230113299 is a prime.
It is a super-2 number, since 2×1132301133152 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (113230113319) 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, 14914534 + ... + 14922123.
It is an arithmetic number, because the mean of its divisors is an integer number (6444718128).
Almost surely, 2113230113315 is an apocalyptic number.
113230113315 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
113230113315 is a deficient number, since it is larger than the sum of its proper divisors (93000866781).
113230113315 is a wasteful number, since it uses less digits than its factorization.
113230113315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29836699.
The product of its (nonzero) digits is 810, while the sum is 24.
Adding to 113230113315 its reverse (513311032311), we get a palindrome (626541145626).
The spelling of 113230113315 in words is "one hundred thirteen billion, two hundred thirty million, one hundred thirteen thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •