Base | Representation |
---|---|
bin | 101010000000110… |
… | …1001110101011001 |
3 | 10122020122011210120 |
4 | 1110001221311121 |
5 | 10341342012031 |
6 | 351515103453 |
7 | 46635263541 |
oct | 12401516531 |
9 | 3566564716 |
10 | 1409719641 |
11 | 663828260 |
12 | 334141b89 |
13 | 1960a2845 |
14 | d5322321 |
15 | 83b64a96 |
hex | 54069d59 |
1409719641 has 8 divisors (see below), whose sum is σ = 2050501344. Its totient is φ = 854375520.
The previous prime is 1409719603. The next prime is 1409719669. The reversal of 1409719641 is 1469179041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1409719641 - 223 = 1401331033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1409719593 and 1409719602.
It is not an unprimeable number, because it can be changed into a prime (1409719601) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21359356 + ... + 21359421.
It is an arithmetic number, because the mean of its divisors is an integer number (256312668).
Almost surely, 21409719641 is an apocalyptic number.
1409719641 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1409719641 is a deficient number, since it is larger than the sum of its proper divisors (640781703).
1409719641 is a wasteful number, since it uses less digits than its factorization.
1409719641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42718791.
The product of its (nonzero) digits is 54432, while the sum is 42.
The square root of 1409719641 is about 37546.2333796614. The cubic root of 1409719641 is about 1121.2718441350.
It can be divided in two parts, 1409719 and 641, that added together give a triangular number (1410360 = T1679).
The spelling of 1409719641 in words is "one billion, four hundred nine million, seven hundred nineteen thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •