Base | Representation |
---|---|
bin | 110100101110100100… |
… | …1110100010011101011 |
3 | 101211021022222210211012 |
4 | 1221131021310103223 |
5 | 3323344343114311 |
6 | 124003522454135 |
7 | 11115665104415 |
oct | 1513511642353 |
9 | 354238883735 |
10 | 113232004331 |
11 | 44026572876 |
12 | 19b4120434b |
13 | a8a6c92ac4 |
14 | 56a253d9b5 |
15 | 2e2ac1878b |
hex | 1a5d2744eb |
113232004331 has 8 divisors (see below), whose sum is σ = 118485811584. Its totient is φ = 108078269760.
The previous prime is 113232004313. The next prime is 113232004337. The reversal of 113232004331 is 133400232311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113232004331 is a prime.
It is a super-2 number, since 2×1132320043312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113232004297 and 113232004306.
It is not an unprimeable number, because it can be changed into a prime (113232004337) 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, 25015856 + ... + 25020381.
It is an arithmetic number, because the mean of its divisors is an integer number (14810726448).
Almost surely, 2113232004331 is an apocalyptic number.
113232004331 is a deficient number, since it is larger than the sum of its proper divisors (5253807253).
113232004331 is an equidigital number, since it uses as much as digits as its factorization.
113232004331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50036341.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 113232004331 its reverse (133400232311), we get a palindrome (246632236642).
The spelling of 113232004331 in words is "one hundred thirteen billion, two hundred thirty-two million, four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •