Base | Representation |
---|---|
bin | 111111100110111… |
… | …1010011011000001 |
3 | 12111202011101201101 |
4 | 1333031322123001 |
5 | 13332343303401 |
6 | 551442334401 |
7 | 103614464152 |
oct | 17715723301 |
9 | 5452141641 |
10 | 2134353601 |
11 | 9a58724a6 |
12 | 4b695a401 |
13 | 280258633 |
14 | 16366d929 |
15 | c75a1101 |
hex | 7f37a6c1 |
2134353601 has 2 divisors, whose sum is σ = 2134353602. Its totient is φ = 2134353600.
The previous prime is 2134353527. The next prime is 2134353643. The reversal of 2134353601 is 1063534312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1111889025 + 1022464576 = 33345^2 + 31976^2 .
It is a cyclic number.
It is not a de Polignac number, because 2134353601 - 211 = 2134351553 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2134353601.
It is not a weakly prime, because it can be changed into another prime (2134353671) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1067176800 + 1067176801.
It is an arithmetic number, because the mean of its divisors is an integer number (1067176801).
Almost surely, 22134353601 is an apocalyptic number.
It is an amenable number.
2134353601 is a deficient number, since it is larger than the sum of its proper divisors (1).
2134353601 is an equidigital number, since it uses as much as digits as its factorization.
2134353601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 28.
The square root of 2134353601 is about 46199.0649364248. The cubic root of 2134353601 is about 1287.5243671010.
Adding to 2134353601 its reverse (1063534312), we get a palindrome (3197887913).
The spelling of 2134353601 in words is "two billion, one hundred thirty-four million, three hundred fifty-three thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •