Base | Representation |
---|---|
bin | 110100101110110110… |
… | …0001011111111010111 |
3 | 101211021221221120002012 |
4 | 1221131230023333113 |
5 | 3323404144423411 |
6 | 124004443534435 |
7 | 11116134511352 |
oct | 1513554137727 |
9 | 354257846065 |
10 | 113241014231 |
11 | 44030667074 |
12 | 19b4422a41b |
13 | a8a8ac8ac7 |
14 | 56a3807299 |
15 | 2e2b8e818b |
hex | 1a5db0bfd7 |
113241014231 has 8 divisors (see below), whose sum is σ = 113325062928. Its totient is φ = 113157000000.
The previous prime is 113241014221. The next prime is 113241014291. The reversal of 113241014231 is 132410142311.
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 113241014231 - 214 = 113240997847 is a prime.
It is a super-2 number, since 2×1132410142312 (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 = 113241014197 and 113241014206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113241014221) 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, 11432381 + ... + 11442281.
It is an arithmetic number, because the mean of its divisors is an integer number (14165632866).
Almost surely, 2113241014231 is an apocalyptic number.
113241014231 is a deficient number, since it is larger than the sum of its proper divisors (84048697).
113241014231 is an equidigital number, since it uses as much as digits as its factorization.
113241014231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17233.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 113241014231 its reverse (132410142311), we get a palindrome (245651156542).
The spelling of 113241014231 in words is "one hundred thirteen billion, two hundred forty-one million, fourteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •