Base | Representation |
---|---|
bin | 101001111001110… |
… | …0011110100110001 |
3 | 10121222200110201100 |
4 | 1103303203310301 |
5 | 10334420300014 |
6 | 351303555013 |
7 | 46562005164 |
oct | 12363436461 |
9 | 3558613640 |
10 | 1406025009 |
11 | 661734444 |
12 | 332a5ba69 |
13 | 1953aac7c |
14 | d4a3dadb |
15 | 83685009 |
hex | 53ce3d31 |
1406025009 has 27 divisors (see below), whose sum is σ = 2108263339. Its totient is φ = 902927760.
The previous prime is 1406024959. The next prime is 1406025017. The reversal of 1406025009 is 9005206041.
The square root of 1406025009 is 37497.
It is a perfect power (a square), and thus also a powerful number.
1406025009 is a `hidden beast` number, since 1 + 4 + 0 + 602 + 50 + 0 + 9 = 666.
It can be written as a sum of positive squares in only one way, i.e., 737285409 + 668739600 = 27153^2 + 25860^2 .
It is not a de Polignac number, because 1406025009 - 29 = 1406024497 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1406025059) 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 26 ways as a sum of consecutive naturals, for example, 3262024 + ... + 3262454.
Almost surely, 21406025009 is an apocalyptic number.
1406025009 is the 37497-th square number.
1406025009 is the 18749-th centered octagonal number.
It is an amenable number.
1406025009 is a deficient number, since it is larger than the sum of its proper divisors (702238330).
1406025009 is an frugal number, since it uses more digits than its factorization.
1406025009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 926 (or 463 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The cubic root of 1406025009 is about 1120.2914337793.
The spelling of 1406025009 in words is "one billion, four hundred six million, twenty-five thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •