Base | Representation |
---|---|
bin | 110100110110110001… |
… | …1101110110110000000 |
3 | 101211222111212212210020 |
4 | 1221231203232312000 |
5 | 3324430322430102 |
6 | 124051113533440 |
7 | 11125546363665 |
oct | 1515543566600 |
9 | 354874785706 |
10 | 113507233152 |
11 | 44157968305 |
12 | 19bb9414280 |
13 | a91bcc98b1 |
14 | 56cad05a6c |
15 | 2e44e82bbc |
hex | 1a6d8eed80 |
113507233152 has 32 divisors (see below), whose sum is σ = 301503589080. Its totient is φ = 37835744256.
The previous prime is 113507233129. The next prime is 113507233153. The reversal of 113507233152 is 251332705311.
It is a tau number, because it is divible by the number of its divisors (32).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113507233153) 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, 147795493 + ... + 147796260.
Almost surely, 2113507233152 is an apocalyptic number.
113507233152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
113507233152 is an abundant number, since it is smaller than the sum of its proper divisors (187996355928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113507233152 is an equidigital number, since it uses as much as digits as its factorization.
113507233152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 295591770 (or 295591758 counting only the distinct ones).
The product of its (nonzero) digits is 18900, while the sum is 33.
Adding to 113507233152 its reverse (251332705311), we get a palindrome (364839938463).
The spelling of 113507233152 in words is "one hundred thirteen billion, five hundred seven million, two hundred thirty-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •