Base | Representation |
---|---|
bin | 111101101011111… |
… | …0111011101100001 |
3 | 12100020210110222002 |
4 | 1323113313131201 |
5 | 13214340312144 |
6 | 541220053345 |
7 | 102202316624 |
oct | 17327673541 |
9 | 5306713862 |
10 | 2069854049 |
11 | 972418a8a |
12 | 499234255 |
13 | 26ca94613 |
14 | 158c7ddbb |
15 | c1ab014e |
hex | 7b5f7761 |
2069854049 has 4 divisors (see below), whose sum is σ = 2070016560. Its totient is φ = 2069691540.
The previous prime is 2069854027. The next prime is 2069854051. The reversal of 2069854049 is 9404589602.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2069854049 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2069853994 and 2069854012.
It is not an unprimeable number, because it can be changed into a prime (2069854069) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 60359 + ... + 88220.
It is an arithmetic number, because the mean of its divisors is an integer number (517504140).
Almost surely, 22069854049 is an apocalyptic number.
It is an amenable number.
2069854049 is a deficient number, since it is larger than the sum of its proper divisors (162511).
2069854049 is a wasteful number, since it uses less digits than its factorization.
2069854049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162510.
The product of its (nonzero) digits is 622080, while the sum is 47.
The square root of 2069854049 is about 45495.6486820443. The cubic root of 2069854049 is about 1274.4219446012.
It can be divided in two parts, 20698 and 54049, that added together give a palindrome (74747).
The spelling of 2069854049 in words is "two billion, sixty-nine million, eight hundred fifty-four thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •