Base | Representation |
---|---|
bin | 110100110001010010… |
… | …0111110110010011111 |
3 | 101211111200020102211010 |
4 | 1221202210332302133 |
5 | 3324041142324411 |
6 | 124020533230303 |
7 | 11121151462563 |
oct | 1514244766237 |
9 | 354450212733 |
10 | 113323011231 |
11 | 44072981691 |
12 | 19b67792393 |
13 | a8bcaa8141 |
14 | 56b066d6a3 |
15 | 2e33be37a6 |
hex | 1a6293ec9f |
113323011231 has 8 divisors (see below), whose sum is σ = 151545709744. Its totient is φ = 75324493440.
The previous prime is 113323011199. The next prime is 113323011251. The reversal of 113323011231 is 132110323311.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 113323011231 - 25 = 113323011199 is a prime.
It is a super-2 number, since 2×1133230112312 (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 = 113323011198 and 113323011207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113323011251) 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, 56044000 + ... + 56046021.
It is an arithmetic number, because the mean of its divisors is an integer number (18943213718).
Almost surely, 2113323011231 is an apocalyptic number.
113323011231 is a deficient number, since it is larger than the sum of its proper divisors (38222698513).
113323011231 is a wasteful number, since it uses less digits than its factorization.
113323011231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112090361.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 113323011231 its reverse (132110323311), we get a palindrome (245433334542).
The spelling of 113323011231 in words is "one hundred thirteen billion, three hundred twenty-three million, eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •