Base | Representation |
---|---|
bin | 1111110101110101… |
… | …1100011101111101 |
3 | 101222100112222122111 |
4 | 3331131130131331 |
5 | 32202100320204 |
6 | 1541542414021 |
7 | 210243262531 |
oct | 37535343575 |
9 | 11870488574 |
10 | 4252354429 |
11 | 1892385904 |
12 | 9a8131311 |
13 | 529ca996b |
14 | 2c4a83bc1 |
15 | 19d4c1d04 |
hex | fd75c77d |
4252354429 has 2 divisors, whose sum is σ = 4252354430. Its totient is φ = 4252354428.
The previous prime is 4252354427. The next prime is 4252354487. The reversal of 4252354429 is 9244532524.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3684247204 + 568107225 = 60698^2 + 23835^2 .
It is a cyclic number.
It is not a de Polignac number, because 4252354429 - 21 = 4252354427 is a prime.
Together with 4252354427, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 4252354391 and 4252354400.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4252354423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2126177214 + 2126177215.
It is an arithmetic number, because the mean of its divisors is an integer number (2126177215).
Almost surely, 24252354429 is an apocalyptic number.
It is an amenable number.
4252354429 is a deficient number, since it is larger than the sum of its proper divisors (1).
4252354429 is an equidigital number, since it uses as much as digits as its factorization.
4252354429 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 345600, while the sum is 40.
The square root of 4252354429 is about 65210.0791979277. The cubic root of 4252354429 is about 1620.1049605570.
The spelling of 4252354429 in words is "four billion, two hundred fifty-two million, three hundred fifty-four thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •