Base | Representation |
---|---|
bin | 101001110110000… |
… | …0110101010010111 |
3 | 10121212000011201000 |
4 | 1103230012222113 |
5 | 10333420224201 |
6 | 351154034343 |
7 | 46536255102 |
oct | 12354065227 |
9 | 3555004630 |
10 | 1404070551 |
11 | 660619a94 |
12 | 3322789b3 |
13 | 194b754a0 |
14 | d4691739 |
15 | 833ead86 |
hex | 53b06a97 |
1404070551 has 32 divisors (see below), whose sum is σ = 2243082240. Its totient is φ = 862898400.
The previous prime is 1404070537. The next prime is 1404070571. The reversal of 1404070551 is 1550704041.
It is a happy number.
1404070551 is a `hidden beast` number, since 1 + 4 + 0 + 40 + 70 + 551 = 666.
It is not a de Polignac number, because 1404070551 - 29 = 1404070039 is a prime.
It is a super-2 number, since 2×14040705512 = 3942828224370887202, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1404070501) 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, 317566 + ... + 321956.
It is an arithmetic number, because the mean of its divisors is an integer number (70096320).
Almost surely, 21404070551 is an apocalyptic number.
1404070551 is a deficient number, since it is larger than the sum of its proper divisors (839011689).
1404070551 is a wasteful number, since it uses less digits than its factorization.
1404070551 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5324 (or 5318 counting only the distinct ones).
The product of its (nonzero) digits is 2800, while the sum is 27.
The square root of 1404070551 is about 37470.9294120122. The cubic root of 1404070551 is about 1119.7721025996.
Adding to 1404070551 its reverse (1550704041), we get a palindrome (2954774592).
The spelling of 1404070551 in words is "one billion, four hundred four million, seventy thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •