Base | Representation |
---|---|
bin | 111111110100110… |
… | …0110110111110001 |
3 | 12112020211020111111 |
4 | 1333221212313301 |
5 | 13341223113203 |
6 | 552302113321 |
7 | 104033262202 |
oct | 17751466761 |
9 | 5466736444 |
10 | 2141613553 |
11 | 9a9980a62 |
12 | 4b927b841 |
13 | 2818cac71 |
14 | 1645dd5a9 |
15 | c803726d |
hex | 7fa66df1 |
2141613553 has 2 divisors, whose sum is σ = 2141613554. Its totient is φ = 2141613552.
The previous prime is 2141613533. The next prime is 2141613563. The reversal of 2141613553 is 3553161412.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2040148224 + 101465329 = 45168^2 + 10073^2 .
It is a cyclic number.
It is not a de Polignac number, because 2141613553 - 29 = 2141613041 is a prime.
It is a super-2 number, since 2×21416135532 = 9173017220786567618, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2141613533) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1070806776 + 1070806777.
It is an arithmetic number, because the mean of its divisors is an integer number (1070806777).
Almost surely, 22141613553 is an apocalyptic number.
It is an amenable number.
2141613553 is a deficient number, since it is larger than the sum of its proper divisors (1).
2141613553 is an equidigital number, since it uses as much as digits as its factorization.
2141613553 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 10800, while the sum is 31.
The square root of 2141613553 is about 46277.5707335638. The cubic root of 2141613553 is about 1288.9825426665.
Adding to 2141613553 its reverse (3553161412), we get a palindrome (5694774965).
It can be divided in two parts, 21416 and 13553, that added together give a square (34969 = 1872).
The spelling of 2141613553 in words is "two billion, one hundred forty-one million, six hundred thirteen thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •