Base | Representation |
---|---|
bin | 101001110110100… |
… | …1110100110100101 |
3 | 10121212120010220201 |
4 | 1103231032212211 |
5 | 10334004141341 |
6 | 351204230501 |
7 | 46541623150 |
oct | 12355164645 |
9 | 3555503821 |
10 | 1404365221 |
11 | 660800416 |
12 | 33239b431 |
13 | 194c4964c |
14 | d472ac97 |
15 | 83458331 |
hex | 53b4e9a5 |
1404365221 has 32 divisors (see below), whose sum is σ = 1729900800. Its totient is φ = 1113315840.
The previous prime is 1404365213. The next prime is 1404365231. The reversal of 1404365221 is 1225634041.
It is not a de Polignac number, because 1404365221 - 23 = 1404365213 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1404365221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1404365231) 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 31 ways as a sum of consecutive naturals, for example, 1980415 + ... + 1981123.
It is an arithmetic number, because the mean of its divisors is an integer number (54059400).
Almost surely, 21404365221 is an apocalyptic number.
It is an amenable number.
1404365221 is a deficient number, since it is larger than the sum of its proper divisors (325535579).
1404365221 is a wasteful number, since it uses less digits than its factorization.
1404365221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1069.
The product of its (nonzero) digits is 5760, while the sum is 28.
The square root of 1404365221 is about 37474.8611872012. The cubic root of 1404365221 is about 1119.8504320361.
Adding to 1404365221 its reverse (1225634041), we get a palindrome (2629999262).
The spelling of 1404365221 in words is "one billion, four hundred four million, three hundred sixty-five thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •