Base | Representation |
---|---|
bin | 111101000000010… |
… | …1010011000110001 |
3 | 12021122210001211110 |
4 | 1322000222120301 |
5 | 13143012301334 |
6 | 535042103533 |
7 | 101504106306 |
oct | 17200523061 |
9 | 5248701743 |
10 | 2046993969 |
11 | 960524959 |
12 | 49164aba9 |
13 | 26811c447 |
14 | 155c0d0ad |
15 | bea96ae9 |
hex | 7a02a631 |
2046993969 has 4 divisors (see below), whose sum is σ = 2729325296. Its totient is φ = 1364662644.
The previous prime is 2046993929. The next prime is 2046993989. The reversal of 2046993969 is 9693996402.
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 not a de Polignac number, because 2046993969 - 27 = 2046993841 is a prime.
It is a super-2 number, since 2×20469939692 = 8380368618244745922, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2046993929) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 341165659 + ... + 341165664.
It is an arithmetic number, because the mean of its divisors is an integer number (682331324).
Almost surely, 22046993969 is an apocalyptic number.
It is an amenable number.
2046993969 is a deficient number, since it is larger than the sum of its proper divisors (682331327).
2046993969 is an equidigital number, since it uses as much as digits as its factorization.
2046993969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 682331326.
The product of its (nonzero) digits is 5668704, while the sum is 57.
The square root of 2046993969 is about 45243.7174533658. The cubic root of 2046993969 is about 1269.7128681070.
The spelling of 2046993969 in words is "two billion, forty-six million, nine hundred ninety-three thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •