Base | Representation |
---|---|
bin | 110100110001000011… |
… | …0111001000110010011 |
3 | 101211111010101201000202 |
4 | 1221202012321012103 |
5 | 3324032132423403 |
6 | 124020052205415 |
7 | 11121024441563 |
oct | 1514206710623 |
9 | 354433351022 |
10 | 113315123603 |
11 | 44069484590 |
12 | 19b6500986b |
13 | a8bb275bc6 |
14 | 56ad5b8da3 |
15 | 2e33186688 |
hex | 1a621b9193 |
113315123603 has 4 divisors (see below), whose sum is σ = 123616498488. Its totient is φ = 103013748720.
The previous prime is 113315123563. The next prime is 113315123609. The reversal of 113315123603 is 306321513311.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 306321513311 = 11 ⋅27847410301.
It is a cyclic number.
It is not a de Polignac number, because 113315123603 - 210 = 113315122579 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113315123609) 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 3 ways as a sum of consecutive naturals, for example, 5150687426 + ... + 5150687447.
It is an arithmetic number, because the mean of its divisors is an integer number (30904124622).
Almost surely, 2113315123603 is an apocalyptic number.
113315123603 is a deficient number, since it is larger than the sum of its proper divisors (10301374885).
113315123603 is a wasteful number, since it uses less digits than its factorization.
113315123603 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10301374884.
The product of its (nonzero) digits is 4860, while the sum is 29.
Adding to 113315123603 its reverse (306321513311), we get a palindrome (419636636914).
The spelling of 113315123603 in words is "one hundred thirteen billion, three hundred fifteen million, one hundred twenty-three thousand, six hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •