Base | Representation |
---|---|
bin | 110100101110000101… |
… | …1000110101011001011 |
3 | 101211020012001120121020 |
4 | 1221130023012223023 |
5 | 3323331141030431 |
6 | 124002134243523 |
7 | 11115405264021 |
oct | 1513413065313 |
9 | 354205046536 |
10 | 113215564491 |
11 | 44018264327 |
12 | 19b377b65a3 |
13 | a8a3757ca3 |
14 | 56a02a0711 |
15 | 2e2956c696 |
hex | 1a5c2c6acb |
113215564491 has 4 divisors (see below), whose sum is σ = 150954085992. Its totient is φ = 75477042992.
The previous prime is 113215564453. The next prime is 113215564519. The reversal of 113215564491 is 194465512311.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 113215564491 - 213 = 113215556299 is a prime.
It is not an unprimeable number, because it can be changed into a prime (113215564591) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18869260746 + ... + 18869260751.
It is an arithmetic number, because the mean of its divisors is an integer number (37738521498).
Almost surely, 2113215564491 is an apocalyptic number.
113215564491 is a deficient number, since it is larger than the sum of its proper divisors (37738521501).
113215564491 is an equidigital number, since it uses as much as digits as its factorization.
113215564491 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37738521500.
The product of its digits is 129600, while the sum is 42.
The spelling of 113215564491 in words is "one hundred thirteen billion, two hundred fifteen million, five hundred sixty-four thousand, four hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •