Base | Representation |
---|---|
bin | 1111110101001111… |
… | …0111111111001001 |
3 | 101222011211112022210 |
4 | 3331103313333021 |
5 | 32200430030310 |
6 | 1541412535333 |
7 | 210213043500 |
oct | 37523677711 |
9 | 11864745283 |
10 | 4249845705 |
11 | 1890a21a86 |
12 | 9a7321549 |
13 | 52960bb01 |
14 | 2c45cd837 |
15 | 19d178820 |
hex | fd4f7fc9 |
4249845705 has 24 divisors (see below), whose sum is σ = 7909918272. Its totient is φ = 1942786272.
The previous prime is 4249845689. The next prime is 4249845709. The reversal of 4249845705 is 5075489424.
It is not a de Polignac number, because 4249845705 - 24 = 4249845689 is a prime.
It is a super-2 number, since 2×42498457052 = 36122377032613894050, which contains 22 as substring.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (4249845709) 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 in 23 ways as a sum of consecutive naturals, for example, 2890317 + ... + 2891786.
It is an arithmetic number, because the mean of its divisors is an integer number (329579928).
Almost surely, 24249845705 is an apocalyptic number.
It is an amenable number.
4249845705 is a deficient number, since it is larger than the sum of its proper divisors (3660072567).
4249845705 is a wasteful number, since it uses less digits than its factorization.
4249845705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5782125 (or 5782118 counting only the distinct ones).
The product of its (nonzero) digits is 1612800, while the sum is 48.
The square root of 4249845705 is about 65190.8406526561. The cubic root of 4249845705 is about 1619.7862982092.
The spelling of 4249845705 in words is "four billion, two hundred forty-nine million, eight hundred forty-five thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •