Base | Representation |
---|---|
bin | 110100110001100010… |
… | …0110001011110110011 |
3 | 101211112020220212001111 |
4 | 1221203010301132303 |
5 | 3324100311022311 |
6 | 124021432014151 |
7 | 11121312353341 |
oct | 1514304613663 |
9 | 354466825044 |
10 | 113331345331 |
11 | 44077654176 |
12 | 19b6a531357 |
13 | a8c1735669 |
14 | 56b17dc991 |
15 | 2e347dcd21 |
hex | 1a631317b3 |
113331345331 has 16 divisors (see below), whose sum is σ = 124508448000. Its totient is φ = 102677385888.
The previous prime is 113331345329. The next prime is 113331345343. The reversal of 113331345331 is 133543133311.
It is a cyclic number.
It is not a de Polignac number, because 113331345331 - 21 = 113331345329 is a prime.
It is a super-2 number, since 2×1133313453312 (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 = 113331345293 and 113331345302.
It is not an unprimeable number, because it can be changed into a prime (113311345331) 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 15 ways as a sum of consecutive naturals, for example, 2352120 + ... + 2399818.
It is an arithmetic number, because the mean of its divisors is an integer number (7781778000).
Almost surely, 2113331345331 is an apocalyptic number.
113331345331 is a deficient number, since it is larger than the sum of its proper divisors (11177102669).
113331345331 is a wasteful number, since it uses less digits than its factorization.
113331345331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53178.
The product of its digits is 14580, while the sum is 31.
Adding to 113331345331 its reverse (133543133311), we get a palindrome (246874478642).
The spelling of 113331345331 in words is "one hundred thirteen billion, three hundred thirty-one million, three hundred forty-five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •