Base | Representation |
---|---|
bin | 1100110110101011… |
… | …0001111110010101 |
3 | 22220110210210112201 |
4 | 3031222301332111 |
5 | 24031314402041 |
6 | 1330221044501 |
7 | 151336066051 |
oct | 31552617625 |
9 | 8813723481 |
10 | 3450544021 |
11 | 1510818881 |
12 | 8036b6731 |
13 | 42cb41a32 |
14 | 24a3a6c61 |
15 | 152ddd631 |
hex | cdab1f95 |
3450544021 has 2 divisors, whose sum is σ = 3450544022. Its totient is φ = 3450544020.
The previous prime is 3450543997. The next prime is 3450544037. The reversal of 3450544021 is 1204450543.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3275272900 + 175271121 = 57230^2 + 13239^2 .
It is an emirp because it is prime and its reverse (1204450543) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3450544021 - 25 = 3450543989 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3450544081) 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, 1725272010 + 1725272011.
It is an arithmetic number, because the mean of its divisors is an integer number (1725272011).
Almost surely, 23450544021 is an apocalyptic number.
It is an amenable number.
3450544021 is a deficient number, since it is larger than the sum of its proper divisors (1).
3450544021 is an equidigital number, since it uses as much as digits as its factorization.
3450544021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9600, while the sum is 28.
The square root of 3450544021 is about 58741.3314540963. The cubic root of 3450544021 is about 1511.1092270796.
Adding to 3450544021 its reverse (1204450543), we get a palindrome (4654994564).
The spelling of 3450544021 in words is "three billion, four hundred fifty million, five hundred forty-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •