Base | Representation |
---|---|
bin | 110100100111110000… |
… | …0010110011100001001 |
3 | 101210200101010201110211 |
4 | 1221033200112130021 |
5 | 3322412233432111 |
6 | 123525103041121 |
7 | 11110214623531 |
oct | 1511740263411 |
9 | 353611121424 |
10 | 113003030281 |
11 | 43a192a0219 |
12 | 19a985a01a1 |
13 | a86b7027bb |
14 | 567dd784c1 |
15 | 2e15a89521 |
hex | 1a4f816709 |
113003030281 has 2 divisors, whose sum is σ = 113003030282. Its totient is φ = 113003030280.
The previous prime is 113003030279. The next prime is 113003030317. The reversal of 113003030281 is 182030300311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 110035504656 + 2967525625 = 331716^2 + 54475^2 .
It is a cyclic number.
It is not a de Polignac number, because 113003030281 - 21 = 113003030279 is a prime.
It is a super-2 number, since 2×1130030302812 (a number of 23 digits) contains 22 as substring.
Together with 113003030279, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (113003030201) 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, 56501515140 + 56501515141.
It is an arithmetic number, because the mean of its divisors is an integer number (56501515141).
Almost surely, 2113003030281 is an apocalyptic number.
It is an amenable number.
113003030281 is a deficient number, since it is larger than the sum of its proper divisors (1).
113003030281 is an equidigital number, since it uses as much as digits as its factorization.
113003030281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 113003030281 its reverse (182030300311), we get a palindrome (295033330592).
The spelling of 113003030281 in words is "one hundred thirteen billion, three million, thirty thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •