Base | Representation |
---|---|
bin | 1111101110001101… |
… | …0101110100101001 |
3 | 101220010022202211211 |
4 | 3323203111310221 |
5 | 32120402030031 |
6 | 1534440353121 |
7 | 206404226461 |
oct | 37343256451 |
9 | 11803282754 |
10 | 4220345641 |
11 | 1876303166 |
12 | 9994757a1 |
13 | 523480555 |
14 | 2c0710ba1 |
15 | 19a79cbb1 |
hex | fb8d5d29 |
4220345641 has 2 divisors, whose sum is σ = 4220345642. Its totient is φ = 4220345640.
The previous prime is 4220345629. The next prime is 4220345671. The reversal of 4220345641 is 1465430224.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4144655641 + 75690000 = 64379^2 + 8700^2 .
It is a cyclic number.
It is not a de Polignac number, because 4220345641 - 25 = 4220345609 is a prime.
It is a super-2 number, since 2×42203456412 = 35622634659015401762, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (4220345621) 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, 2110172820 + 2110172821.
It is an arithmetic number, because the mean of its divisors is an integer number (2110172821).
Almost surely, 24220345641 is an apocalyptic number.
It is an amenable number.
4220345641 is a deficient number, since it is larger than the sum of its proper divisors (1).
4220345641 is an equidigital number, since it uses as much as digits as its factorization.
4220345641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23040, while the sum is 31.
The square root of 4220345641 is about 64964.1873727364. The cubic root of 4220345641 is about 1616.0297076575.
Adding to 4220345641 its reverse (1465430224), we get a palindrome (5685775865).
The spelling of 4220345641 in words is "four billion, two hundred twenty million, three hundred forty-five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •