Base | Representation |
---|---|
bin | 100011110010111… |
… | …1001100011101001 |
3 | 10002201010002100021 |
4 | 1013211321203221 |
5 | 4424441224132 |
6 | 315104040441 |
7 | 41523221023 |
oct | 10745714351 |
9 | 3081102307 |
10 | 1201117417 |
11 | 566aaa325 |
12 | 296303121 |
13 | 161ac5c86 |
14 | b5741013 |
15 | 706ab997 |
hex | 479798e9 |
1201117417 has 2 divisors, whose sum is σ = 1201117418. Its totient is φ = 1201117416.
The previous prime is 1201117397. The next prime is 1201117441. The reversal of 1201117417 is 7147111021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1164925161 + 36192256 = 34131^2 + 6016^2 .
It is a cyclic number.
It is not a de Polignac number, because 1201117417 - 211 = 1201115369 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1201117391 and 1201117400.
It is not a weakly prime, because it can be changed into another prime (1201114417) 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, 600558708 + 600558709.
It is an arithmetic number, because the mean of its divisors is an integer number (600558709).
Almost surely, 21201117417 is an apocalyptic number.
It is an amenable number.
1201117417 is a deficient number, since it is larger than the sum of its proper divisors (1).
1201117417 is an equidigital number, since it uses as much as digits as its factorization.
1201117417 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 392, while the sum is 25.
The square root of 1201117417 is about 34657.1409236250. The cubic root of 1201117417 is about 1062.9883092852.
Adding to 1201117417 its reverse (7147111021), we get a palindrome (8348228438).
The spelling of 1201117417 in words is "one billion, two hundred one million, one hundred seventeen thousand, four hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •