Base | Representation |
---|---|
bin | 101001110101111… |
… | …1100110100010111 |
3 | 10121211221010101200 |
4 | 1103223330310113 |
5 | 10333412431411 |
6 | 351153123543 |
7 | 46536026412 |
oct | 12353746427 |
9 | 3554833350 |
10 | 1404030231 |
11 | 6605a176a |
12 | 3322595b3 |
13 | 194b60026 |
14 | d4680b79 |
15 | 833dde56 |
hex | 53afcd17 |
1404030231 has 24 divisors (see below), whose sum is σ = 2086833840. Its totient is φ = 908983296.
The previous prime is 1404030223. The next prime is 1404030233. The reversal of 1404030231 is 1320304041.
1404030231 is a `hidden beast` number, since 1 + 404 + 0 + 30 + 231 = 666.
It is not a de Polignac number, because 1404030231 - 23 = 1404030223 is a prime.
It is a super-2 number, since 2×14040302312 = 3942601779123826722, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1404030233) 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 23 ways as a sum of consecutive naturals, for example, 183735 + ... + 191223.
It is an arithmetic number, because the mean of its divisors is an integer number (86951410).
Almost surely, 21404030231 is an apocalyptic number.
1404030231 is a deficient number, since it is larger than the sum of its proper divisors (682803609).
1404030231 is a wasteful number, since it uses less digits than its factorization.
1404030231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8095 (or 8092 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
The square root of 1404030231 is about 37470.3913910704. The cubic root of 1404030231 is about 1119.7613838497.
Adding to 1404030231 its reverse (1320304041), we get a palindrome (2724334272).
The spelling of 1404030231 in words is "one billion, four hundred four million, thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.002 sec. • engine limits •