Base | Representation |
---|---|
bin | 101001110001011… |
… | …0001111000010011 |
3 | 10121200101222120221 |
4 | 1103202301320103 |
5 | 10332304014011 |
6 | 351025413511 |
7 | 46506424363 |
oct | 12342617023 |
9 | 3550358527 |
10 | 1401626131 |
11 | 65a1aa504 |
12 | 33149a297 |
13 | 1944ca999 |
14 | d42169a3 |
15 | 830b6971 |
hex | 538b1e13 |
1401626131 has 4 divisors (see below), whose sum is σ = 1422545992. Its totient is φ = 1380706272.
The previous prime is 1401626129. The next prime is 1401626209. The reversal of 1401626131 is 1316261041.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1401626131 - 21 = 1401626129 is a prime.
It is a super-2 number, since 2×14016261312 = 3929111622204058322, 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 = 1401626096 and 1401626105.
It is not an unprimeable number, because it can be changed into a prime (1401626111) 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, 10459830 + ... + 10459963.
It is an arithmetic number, because the mean of its divisors is an integer number (355636498).
Almost surely, 21401626131 is an apocalyptic number.
1401626131 is a deficient number, since it is larger than the sum of its proper divisors (20919861).
1401626131 is an equidigital number, since it uses as much as digits as its factorization.
1401626131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20919860.
The product of its (nonzero) digits is 864, while the sum is 25.
The square root of 1401626131 is about 37438.2976509349. The cubic root of 1401626131 is about 1119.1219018196.
Adding to 1401626131 its reverse (1316261041), we get a palindrome (2717887172).
The spelling of 1401626131 in words is "one billion, four hundred one million, six hundred twenty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •