Base | Representation |
---|---|
bin | 101001101110110… |
… | …0010100011100001 |
3 | 10121120211012111221 |
4 | 1103131202203201 |
5 | 10331431041031 |
6 | 350540135041 |
7 | 46461644134 |
oct | 12335424341 |
9 | 3546735457 |
10 | 1400252641 |
11 | 659451597 |
12 | 330b37481 |
13 | 194139778 |
14 | d3d7a21b |
15 | 82de4a11 |
hex | 537628e1 |
1400252641 has 4 divisors (see below), whose sum is σ = 1408843312. Its totient is φ = 1391661972.
The previous prime is 1400252603. The next prime is 1400252647. The reversal of 1400252641 is 1462520041.
It is a happy number.
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: 1462520041 = 19 ⋅76974739.
It is a cyclic number.
It is not a de Polignac number, because 1400252641 - 213 = 1400244449 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1400252647) 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, 4295091 + ... + 4295416.
It is an arithmetic number, because the mean of its divisors is an integer number (352210828).
Almost surely, 21400252641 is an apocalyptic number.
It is an amenable number.
1400252641 is a deficient number, since it is larger than the sum of its proper divisors (8590671).
1400252641 is an equidigital number, since it uses as much as digits as its factorization.
1400252641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8590670.
The product of its (nonzero) digits is 1920, while the sum is 25.
The square root of 1400252641 is about 37419.9497728150. The cubic root of 1400252641 is about 1118.7562301038.
Adding to 1400252641 its reverse (1462520041), we get a palindrome (2862772682).
The spelling of 1400252641 in words is "one billion, four hundred million, two hundred fifty-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •