Base | Representation |
---|---|
bin | 101001111100011… |
… | …1110010010100011 |
3 | 10122002100120101102 |
4 | 1103320332102203 |
5 | 10340301203011 |
6 | 351354225015 |
7 | 46610035442 |
oct | 12370762243 |
9 | 3562316342 |
10 | 1407444131 |
11 | 662513675 |
12 | 33342516b |
13 | 195786ba2 |
14 | d4cccd59 |
15 | 8386573b |
hex | 53e3e4a3 |
1407444131 has 8 divisors (see below), whose sum is σ = 1424077200. Its totient is φ = 1390829440.
The previous prime is 1407444007. The next prime is 1407444139. The reversal of 1407444131 is 1314447041.
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 1407444131 - 230 = 333702307 is a prime.
It is a super-2 number, since 2×14074441312 = 3961797963772690322, 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 = 1407444094 and 1407444103.
It is not an unprimeable number, because it can be changed into a prime (1407444139) 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, 204791 + ... + 211551.
It is an arithmetic number, because the mean of its divisors is an integer number (178009650).
Almost surely, 21407444131 is an apocalyptic number.
1407444131 is a deficient number, since it is larger than the sum of its proper divisors (16633069).
1407444131 is an equidigital number, since it uses as much as digits as its factorization.
1407444131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9189.
The product of its (nonzero) digits is 5376, while the sum is 29.
The square root of 1407444131 is about 37515.9183680741. The cubic root of 1407444131 is about 1120.6682159915.
The spelling of 1407444131 in words is "one billion, four hundred seven million, four hundred forty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •