Base | Representation |
---|---|
bin | 101001101111101… |
… | …1100000000000001 |
3 | 10121121202110212122 |
4 | 1103133130000001 |
5 | 10332043000311 |
6 | 350554534025 |
7 | 46466115323 |
oct | 12337340001 |
9 | 3547673778 |
10 | 1400750081 |
11 | 6597612a5 |
12 | 331137315 |
13 | 194282003 |
14 | d4069613 |
15 | 82e920db |
hex | 537dc001 |
1400750081 has 16 divisors (see below), whose sum is σ = 1434343680. Its totient is φ = 1367681280.
The previous prime is 1400750077. The next prime is 1400750089. The reversal of 1400750081 is 1800570041.
It is a cyclic number.
It is not a de Polignac number, because 1400750081 - 22 = 1400750077 is a prime.
It is a super-2 number, since 2×14007500812 = 3924201578843013122, 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 1400750081.
It is not an unprimeable number, because it can be changed into a prime (1400750089) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4780571 + ... + 4780863.
It is an arithmetic number, because the mean of its divisors is an integer number (89646480).
Almost surely, 21400750081 is an apocalyptic number.
It is an amenable number.
1400750081 is a deficient number, since it is larger than the sum of its proper divisors (33593599).
1400750081 is a wasteful number, since it uses less digits than its factorization.
1400750081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 856.
The product of its (nonzero) digits is 1120, while the sum is 26.
The square root of 1400750081 is about 37426.5959045169. The cubic root of 1400750081 is about 1118.8886938691. Note that the first 3 decimals are identical.
The spelling of 1400750081 in words is "one billion, four hundred million, seven hundred fifty thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •