Base | Representation |
---|---|
bin | 110100101001001111… |
… | …1011101110111110111 |
3 | 101210210212102001200112 |
4 | 1221102133131313313 |
5 | 3323013100131411 |
6 | 123534052533235 |
7 | 11111363515526 |
oct | 1512237356767 |
9 | 353725361615 |
10 | 113053130231 |
11 | 43a445aa038 |
12 | 19ab132121b |
13 | a878bc4542 |
14 | 568689a4bd |
15 | 2e1a183b8b |
hex | 1a527dddf7 |
113053130231 has 8 divisors (see below), whose sum is σ = 119019006000. Its totient is φ = 107088825600.
The previous prime is 113053130213. The next prime is 113053130243. The reversal of 113053130231 is 132031350311.
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 113053130231 - 222 = 113048935927 is a prime.
It is a super-2 number, since 2×1130531302312 (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 = 113053130197 and 113053130206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113053130291) 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, 243620 + ... + 534281.
It is an arithmetic number, because the mean of its divisors is an integer number (14877375750).
Almost surely, 2113053130231 is an apocalyptic number.
113053130231 is a deficient number, since it is larger than the sum of its proper divisors (5965875769).
113053130231 is an equidigital number, since it uses as much as digits as its factorization.
113053130231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 785569.
The product of its (nonzero) digits is 810, while the sum is 23.
Adding to 113053130231 its reverse (132031350311), we get a palindrome (245084480542).
The spelling of 113053130231 in words is "one hundred thirteen billion, fifty-three million, one hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •