Base | Representation |
---|---|
bin | 101001110001101… |
… | …0001110101100111 |
3 | 10121200122122011002 |
4 | 1103203101311213 |
5 | 10332322211111 |
6 | 351032303515 |
7 | 46510511123 |
oct | 12343216547 |
9 | 3550578132 |
10 | 1401757031 |
11 | 65a289894 |
12 | 331541b9b |
13 | 19454543c |
14 | d424c583 |
15 | 830e063b |
hex | 538d1d67 |
1401757031 has 8 divisors (see below), whose sum is σ = 1430764560. Its totient is φ = 1373044288.
The previous prime is 1401757013. The next prime is 1401757033. The reversal of 1401757031 is 1307571041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1401757031 - 226 = 1334648167 is a prime.
It is a super-2 number, since 2×14017570312 = 3929845547915869922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1401756985 and 1401757003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1401757033) 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 in 7 ways as a sum of consecutive naturals, for example, 64076 + ... + 83121.
It is an arithmetic number, because the mean of its divisors is an integer number (178845570).
Almost surely, 21401757031 is an apocalyptic number.
1401757031 is a deficient number, since it is larger than the sum of its proper divisors (29007529).
1401757031 is a wasteful number, since it uses less digits than its factorization.
1401757031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147393.
The product of its (nonzero) digits is 2940, while the sum is 29.
The square root of 1401757031 is about 37440.0458199506. The cubic root of 1401757031 is about 1119.1567395683.
The spelling of 1401757031 in words is "one billion, four hundred one million, seven hundred fifty-seven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •