Base | Representation |
---|---|
bin | 101001111001110… |
… | …1100100111010001 |
3 | 10121222202022002200 |
4 | 1103303230213101 |
5 | 10334422423014 |
6 | 351304433413 |
7 | 46562215143 |
oct | 12363544721 |
9 | 3558668080 |
10 | 1406061009 |
11 | 6617594a1 |
12 | 332a78869 |
13 | 1953c1482 |
14 | d4a4cc93 |
15 | 83690a09 |
hex | 53cec9d1 |
1406061009 has 48 divisors (see below), whose sum is σ = 2193609600. Its totient is φ = 865133568.
The previous prime is 1406060993. The next prime is 1406061049. The reversal of 1406061009 is 9001606041.
1406061009 is a `hidden beast` number, since 1 + 40 + 6 + 0 + 610 + 0 + 9 = 666.
It is not a de Polignac number, because 1406061009 - 24 = 1406060993 is a prime.
It is a super-2 number, since 2×14060610092 = 3954015122060196162, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1406061049) 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 47 ways as a sum of consecutive naturals, for example, 1513057 + ... + 1513985.
It is an arithmetic number, because the mean of its divisors is an integer number (45700200).
Almost surely, 21406061009 is an apocalyptic number.
1406061009 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
1406061009 is a deficient number, since it is larger than the sum of its proper divisors (787548591).
1406061009 is a wasteful number, since it uses less digits than its factorization.
1406061009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1174 (or 1171 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 27.
The square root of 1406061009 is about 37497.4800353304. The cubic root of 1406061009 is about 1120.3009950477.
The spelling of 1406061009 in words is "one billion, four hundred six million, sixty-one thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •