Base | Representation |
---|---|
bin | 110100101000110111… |
… | …0101110001110010111 |
3 | 101210202222100212110022 |
4 | 1221101232232032113 |
5 | 3323001312232101 |
6 | 123532515015355 |
7 | 11111150065616 |
oct | 1512156561627 |
9 | 353688325408 |
10 | 113040352151 |
11 | 43a38371741 |
12 | 19aa8b9a55b |
13 | a87636c34c |
14 | 5684cd187d |
15 | 2e18eaca1b |
hex | 1a51bae397 |
113040352151 has 8 divisors (see below), whose sum is σ = 114656125440. Its totient is φ = 111435918048.
The previous prime is 113040352097. The next prime is 113040352181. The reversal of 113040352151 is 151253040311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 113040352151 - 222 = 113036157847 is a prime.
It is a super-3 number, since 3×1130403521513 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 113040352151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113040352181) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2814716 + ... + 2854593.
It is an arithmetic number, because the mean of its divisors is an integer number (14332015680).
Almost surely, 2113040352151 is an apocalyptic number.
113040352151 is a deficient number, since it is larger than the sum of its proper divisors (1615773289).
113040352151 is a wasteful number, since it uses less digits than its factorization.
113040352151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5669593.
The product of its (nonzero) digits is 1800, while the sum is 26.
Adding to 113040352151 its reverse (151253040311), we get a palindrome (264293392462).
The spelling of 113040352151 in words is "one hundred thirteen billion, forty million, three hundred fifty-two thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •