Base | Representation |
---|---|
bin | 110100100111110000… |
… | …1000111100000110001 |
3 | 101210200101111221012021 |
4 | 1221033201013200301 |
5 | 3322412311400111 |
6 | 123525111231441 |
7 | 11110216421533 |
oct | 1511741074061 |
9 | 353611457167 |
10 | 113003231281 |
11 | 43a19418236 |
12 | 19a98678581 |
13 | a86b773135 |
14 | 567ddcb853 |
15 | 2e15ac8d71 |
hex | 1a4f847831 |
113003231281 has 2 divisors, whose sum is σ = 113003231282. Its totient is φ = 113003231280.
The previous prime is 113003231251. The next prime is 113003231371. The reversal of 113003231281 is 182132300311.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 85473784881 + 27529446400 = 292359^2 + 165920^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113003231281 is a prime.
It is a super-2 number, since 2×1130032312812 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (113003231251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56501615640 + 56501615641.
It is an arithmetic number, because the mean of its divisors is an integer number (56501615641).
Almost surely, 2113003231281 is an apocalyptic number.
It is an amenable number.
113003231281 is a deficient number, since it is larger than the sum of its proper divisors (1).
113003231281 is an equidigital number, since it uses as much as digits as its factorization.
113003231281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 113003231281 its reverse (182132300311), we get a palindrome (295135531592).
The spelling of 113003231281 in words is "one hundred thirteen billion, three million, two hundred thirty-one thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •