Base | Representation |
---|---|
bin | 101001101110011… |
… | …0101111101100101 |
3 | 10121120110220222001 |
4 | 1103130311331211 |
5 | 10331404214424 |
6 | 350532205301 |
7 | 46460253463 |
oct | 12334657545 |
9 | 3546426861 |
10 | 1400069989 |
11 | 65933733a |
12 | 330a69831 |
13 | 1940a45a6 |
14 | d3d2d833 |
15 | 82daa844 |
hex | 53735f65 |
1400069989 has 4 divisors (see below), whose sum is σ = 1420966624. Its totient is φ = 1379173356.
The previous prime is 1400069959. The next prime is 1400070029. The reversal of 1400069989 is 9899600041.
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, and also an emirpimes, since its reverse is a distinct semiprime: 9899600041 = 1171 ⋅8453971.
It is a cyclic number.
It is not a de Polignac number, because 1400069989 - 27 = 1400069861 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1400069939) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10448217 + ... + 10448350.
It is an arithmetic number, because the mean of its divisors is an integer number (355241656).
Almost surely, 21400069989 is an apocalyptic number.
It is an amenable number.
1400069989 is a deficient number, since it is larger than the sum of its proper divisors (20896635).
1400069989 is an equidigital number, since it uses as much as digits as its factorization.
1400069989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20896634.
The product of its (nonzero) digits is 139968, while the sum is 46.
The square root of 1400069989 is about 37417.5091234037. The cubic root of 1400069989 is about 1118.7075836566.
The spelling of 1400069989 in words is "one billion, four hundred million, sixty-nine thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •