Base | Representation |
---|---|
bin | 1111101100011100… |
… | …1101000101111101 |
3 | 101212121110001011111 |
4 | 3323013031011331 |
5 | 32112010013403 |
6 | 1534014322021 |
7 | 206254436641 |
oct | 37307150575 |
9 | 11777401144 |
10 | 4212969853 |
11 | 1872125674 |
12 | 996ab9311 |
13 | 521a9a291 |
14 | 2bd750c21 |
15 | 199ce256d |
hex | fb1cd17d |
4212969853 has 2 divisors, whose sum is σ = 4212969854. Its totient is φ = 4212969852.
The previous prime is 4212969851. The next prime is 4212969877. The reversal of 4212969853 is 3589692124.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2345174329 + 1867795524 = 48427^2 + 43218^2 .
It is a cyclic number.
It is not a de Polignac number, because 4212969853 - 21 = 4212969851 is a prime.
It is a super-2 number, since 2×42129698532 = 35498229964573683218, which contains 22 as substring.
Together with 4212969851, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 4212969797 and 4212969806.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4212969851) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2106484926 + 2106484927.
It is an arithmetic number, because the mean of its divisors is an integer number (2106484927).
Almost surely, 24212969853 is an apocalyptic number.
It is an amenable number.
4212969853 is a deficient number, since it is larger than the sum of its proper divisors (1).
4212969853 is an equidigital number, since it uses as much as digits as its factorization.
4212969853 is an evil number, because the sum of its binary digits is even.
The product of its digits is 933120, while the sum is 49.
The square root of 4212969853 is about 64907.3944400790. The cubic root of 4212969853 is about 1615.0877276962.
The spelling of 4212969853 in words is "four billion, two hundred twelve million, nine hundred sixty-nine thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •