Base | Representation |
---|---|
bin | 110010011101011… |
… | …0100110100001001 |
3 | 11100222221112120101 |
4 | 1210322310310021 |
5 | 11431421023111 |
6 | 440001525401 |
7 | 56646320605 |
oct | 14472646411 |
9 | 4328845511 |
10 | 1693142281 |
11 | 799809946 |
12 | 3b3043861 |
13 | 20ca1804c |
14 | 120c1c505 |
15 | 9d99bbc1 |
hex | 64eb4d09 |
1693142281 has 4 divisors (see below), whose sum is σ = 1701166864. Its totient is φ = 1685117700.
The previous prime is 1693142249. The next prime is 1693142303. The reversal of 1693142281 is 1822413961.
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 1693142281 - 25 = 1693142249 is a prime.
It is a super-2 number, since 2×16931422812 = 5733461567419765922, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1693142281.
It is not an unprimeable number, because it can be changed into a prime (1693142881) 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, 4011975 + ... + 4012396.
It is an arithmetic number, because the mean of its divisors is an integer number (425291716).
Almost surely, 21693142281 is an apocalyptic number.
It is an amenable number.
1693142281 is a deficient number, since it is larger than the sum of its proper divisors (8024583).
1693142281 is an equidigital number, since it uses as much as digits as its factorization.
1693142281 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8024582.
The product of its digits is 20736, while the sum is 37.
The square root of 1693142281 is about 41147.8101604447. The cubic root of 1693142281 is about 1191.8762110482.
The spelling of 1693142281 in words is "one billion, six hundred ninety-three million, one hundred forty-two thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •