Base | Representation |
---|---|
bin | 111101101010111… |
… | …1100110100000001 |
3 | 12100012211221211212 |
4 | 1323111330310001 |
5 | 13214223223211 |
6 | 541201215505 |
7 | 102165125165 |
oct | 17325746401 |
9 | 5305757755 |
10 | 2069351681 |
11 | 972105601 |
12 | 499031595 |
13 | 26c949a67 |
14 | 158b8cca5 |
15 | c1a1138b |
hex | 7b57cd01 |
2069351681 has 4 divisors (see below), whose sum is σ = 2074755072. Its totient is φ = 2063948292.
The previous prime is 2069351677. The next prime is 2069351689. The reversal of 2069351681 is 1861539602.
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 not a de Polignac number, because 2069351681 - 22 = 2069351677 is a prime.
It is a super-2 number, since 2×20693516812 = 8564432759315051522, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2069351689) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2701121 + ... + 2701886.
It is an arithmetic number, because the mean of its divisors is an integer number (518688768).
Almost surely, 22069351681 is an apocalyptic number.
It is an amenable number.
2069351681 is a deficient number, since it is larger than the sum of its proper divisors (5403391).
2069351681 is an equidigital number, since it uses as much as digits as its factorization.
2069351681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5403390.
The product of its (nonzero) digits is 77760, while the sum is 41.
The square root of 2069351681 is about 45490.1272915344. The cubic root of 2069351681 is about 1274.3188325634.
The spelling of 2069351681 in words is "two billion, sixty-nine million, three hundred fifty-one thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •