Base | Representation |
---|---|
bin | 110100110010000110… |
… | …1100000110000010011 |
3 | 101211120120210121102201 |
4 | 1221210031200300103 |
5 | 3324120201211311 |
6 | 124023352424031 |
7 | 11121633421231 |
oct | 1514415406023 |
9 | 354516717381 |
10 | 113350413331 |
11 | 44087398251 |
12 | 19b749a8017 |
13 | a8c56807bc |
14 | 56b4163951 |
15 | 2e363079c1 |
hex | 1a64360c13 |
113350413331 has 4 divisors (see below), whose sum is σ = 113380555464. Its totient is φ = 113320271200.
The previous prime is 113350413311. The next prime is 113350413383. The reversal of 113350413331 is 133314053311.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 113350413331 - 211 = 113350411283 is a prime.
It is a super-2 number, since 2×1133504133312 (a number of 23 digits) contains 22 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 113350413331.
It is not an unprimeable number, because it can be changed into a prime (113350413301) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15065425 + ... + 15072946.
It is an arithmetic number, because the mean of its divisors is an integer number (28345138866).
Almost surely, 2113350413331 is an apocalyptic number.
113350413331 is a deficient number, since it is larger than the sum of its proper divisors (30142133).
113350413331 is an equidigital number, since it uses as much as digits as its factorization.
113350413331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30142132.
The product of its (nonzero) digits is 4860, while the sum is 28.
Adding to 113350413331 its reverse (133314053311), we get a palindrome (246664466642).
The spelling of 113350413331 in words is "one hundred thirteen billion, three hundred fifty million, four hundred thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •