Base | Representation |
---|---|
bin | 101001101111010… |
… | …0111010101010001 |
3 | 10121121100111221201 |
4 | 1103132213111101 |
5 | 10332014044403 |
6 | 350550151201 |
7 | 46464226351 |
oct | 12336472521 |
9 | 3547314851 |
10 | 1400534353 |
11 | 659624209 |
12 | 331052501 |
13 | 194207a6a |
14 | d4010b61 |
15 | 82e4d21d |
hex | 537a7551 |
1400534353 has 2 divisors, whose sum is σ = 1400534354. Its totient is φ = 1400534352.
The previous prime is 1400534287. The next prime is 1400534383. The reversal of 1400534353 is 3534350041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 798175504 + 602358849 = 28252^2 + 24543^2 .
It is a cyclic number.
It is not a de Polignac number, because 1400534353 - 217 = 1400403281 is a prime.
It is a super-2 number, since 2×14005343532 = 3922992947866257218, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1400534383) 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 as a sum of consecutive naturals, namely, 700267176 + 700267177.
It is an arithmetic number, because the mean of its divisors is an integer number (700267177).
Almost surely, 21400534353 is an apocalyptic number.
It is an amenable number.
1400534353 is a deficient number, since it is larger than the sum of its proper divisors (1).
1400534353 is an equidigital number, since it uses as much as digits as its factorization.
1400534353 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 28.
The square root of 1400534353 is about 37423.7137788328. The cubic root of 1400534353 is about 1118.8312513089.
Adding to 1400534353 its reverse (3534350041), we get a palindrome (4934884394).
The spelling of 1400534353 in words is "one billion, four hundred million, five hundred thirty-four thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.568 sec. • engine limits •