Base | Representation |
---|---|
bin | 101001110001001… |
… | …1111011001011111 |
3 | 10121200021010202020 |
4 | 1103202133121133 |
5 | 10332244103211 |
6 | 351024031223 |
7 | 46505660601 |
oct | 12342373137 |
9 | 3550233666 |
10 | 1401550431 |
11 | 65a158646 |
12 | 331462513 |
13 | 1944a23a8 |
14 | d41d7171 |
15 | 8309e306 |
hex | 5389f65f |
1401550431 has 8 divisors (see below), whose sum is σ = 1978659504. Its totient is φ = 879404160.
The previous prime is 1401550427. The next prime is 1401550439. The reversal of 1401550431 is 1340551041.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1401550431 - 22 = 1401550427 is a prime.
It is a super-2 number, since 2×14015504312 = 3928687221272571522, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1401550439) 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 7 ways as a sum of consecutive naturals, for example, 13740640 + ... + 13740741.
It is an arithmetic number, because the mean of its divisors is an integer number (247332438).
Almost surely, 21401550431 is an apocalyptic number.
1401550431 is a deficient number, since it is larger than the sum of its proper divisors (577109073).
1401550431 is a wasteful number, since it uses less digits than its factorization.
1401550431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27481401.
The product of its (nonzero) digits is 1200, while the sum is 24.
The square root of 1401550431 is about 37437.2866404605. The cubic root of 1401550431 is about 1119.1017540186.
It can be divided in two parts, 14015 and 50431, that added together give a palindrome (64446).
The spelling of 1401550431 in words is "one billion, four hundred one million, five hundred fifty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •