Base | Representation |
---|---|
bin | 110100101101110010… |
… | …0000000101000110111 |
3 | 101211012110202220112002 |
4 | 1221123210000220313 |
5 | 3323321030104101 |
6 | 124001130445515 |
7 | 11115222211334 |
oct | 1513344005067 |
9 | 354173686462 |
10 | 113205316151 |
11 | 440124a4624 |
12 | 19b3429389b |
13 | a8a15aa395 |
14 | 569cb9398b |
15 | 2e286e5d6b |
hex | 1a5b900a37 |
113205316151 has 4 divisors (see below), whose sum is σ = 113206526952. Its totient is φ = 113204105352.
The previous prime is 113205316123. The next prime is 113205316157. The reversal of 113205316151 is 151613502311.
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 113205316151 - 26 = 113205316087 is a prime.
It is a super-2 number, since 2×1132053161512 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113205316157) 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, 452240 + ... + 656453.
It is an arithmetic number, because the mean of its divisors is an integer number (28301631738).
Almost surely, 2113205316151 is an apocalyptic number.
113205316151 is a deficient number, since it is larger than the sum of its proper divisors (1210801).
113205316151 is a wasteful number, since it uses less digits than its factorization.
113205316151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1210800.
The product of its (nonzero) digits is 2700, while the sum is 29.
Adding to 113205316151 its reverse (151613502311), we get a palindrome (264818818462).
The spelling of 113205316151 in words is "one hundred thirteen billion, two hundred five million, three hundred sixteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •