Base | Representation |
---|---|
bin | 100011110011100… |
… | …0110001001001001 |
3 | 10002201201000122122 |
4 | 1013213012021021 |
5 | 4430031243423 |
6 | 315114501025 |
7 | 41525665421 |
oct | 10747061111 |
9 | 3081630578 |
10 | 1201431113 |
11 | 5671a3a83 |
12 | 296434775 |
13 | 161ba59ac |
14 | b57c3481 |
15 | 7071e8c8 |
hex | 479c6249 |
1201431113 has 2 divisors, whose sum is σ = 1201431114. Its totient is φ = 1201431112.
The previous prime is 1201431103. The next prime is 1201431139. The reversal of 1201431113 is 3111341021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 879300409 + 322130704 = 29653^2 + 17948^2 .
It is an emirp because it is prime and its reverse (3111341021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1201431113 - 210 = 1201430089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1201431091 and 1201431100.
It is not a weakly prime, because it can be changed into another prime (1201431103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 600715556 + 600715557.
It is an arithmetic number, because the mean of its divisors is an integer number (600715557).
Almost surely, 21201431113 is an apocalyptic number.
It is an amenable number.
1201431113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1201431113 is an equidigital number, since it uses as much as digits as its factorization.
1201431113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
The square root of 1201431113 is about 34661.6663332852. Note that the first 3 decimals coincide. The cubic root of 1201431113 is about 1063.0808414975.
Adding to 1201431113 its reverse (3111341021), we get a palindrome (4312772134).
The spelling of 1201431113 in words is "one billion, two hundred one million, four hundred thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •