Base | Representation |
---|---|
bin | 101001110101111… |
… | …1100110101111011 |
3 | 10121211221010112101 |
4 | 1103223330311323 |
5 | 10333412432311 |
6 | 351153124231 |
7 | 46536026614 |
oct | 12353746573 |
9 | 3554833471 |
10 | 1404030331 |
11 | 6605a1850 |
12 | 332259677 |
13 | 194b600a2 |
14 | d4680c0b |
15 | 833ddec1 |
hex | 53afcd7b |
1404030331 has 32 divisors (see below), whose sum is σ = 1706987520. Its totient is φ = 1140585600.
The previous prime is 1404030307. The next prime is 1404030343. The reversal of 1404030331 is 1330304041.
It is not a de Polignac number, because 1404030331 - 29 = 1404029819 is a prime.
It is a super-2 number, since 2×14040303312 = 3942602340735939122, 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 = 1404030299 and 1404030308.
It is not an unprimeable number, because it can be changed into a prime (1404030361) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 224361 + ... + 230533.
It is an arithmetic number, because the mean of its divisors is an integer number (53343360).
Almost surely, 21404030331 is an apocalyptic number.
1404030331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1404030331 is a deficient number, since it is larger than the sum of its proper divisors (302957189).
1404030331 is a wasteful number, since it uses less digits than its factorization.
1404030331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6267.
The product of its (nonzero) digits is 432, while the sum is 19.
The square root of 1404030331 is about 37470.3927254573. The cubic root of 1404030331 is about 1119.7614104341.
Adding to 1404030331 its reverse (1330304041), we get a palindrome (2734334372).
The spelling of 1404030331 in words is "one billion, four hundred four million, thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •