Base | Representation |
---|---|
bin | 10100011111011011101… |
… | …101100110100111010101 |
3 | 11222121122201201120000012 |
4 | 110133123231212213111 |
5 | 141032332430030431 |
6 | 2554520225130005 |
7 | 203510014340624 |
oct | 24373355464725 |
9 | 4877581646005 |
10 | 1408140470741 |
11 | 4a3209649464 |
12 | 1a8aa7489905 |
13 | a2a30290674 |
14 | 4c2237db6bb |
15 | 26967b5622b |
hex | 147dbb669d5 |
1408140470741 has 4 divisors (see below), whose sum is σ = 1408144697484. Its totient is φ = 1408136244000.
The previous prime is 1408140470719. The next prime is 1408140470777. The reversal of 1408140470741 is 1470740418041.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 152194394641 + 1255946076100 = 390121^2 + 1120690^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1408140470741 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1408140470791) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1566470 + ... + 2295671.
It is an arithmetic number, because the mean of its divisors is an integer number (352036174371).
Almost surely, 21408140470741 is an apocalyptic number.
It is an amenable number.
1408140470741 is a deficient number, since it is larger than the sum of its proper divisors (4226743).
1408140470741 is an equidigital number, since it uses as much as digits as its factorization.
1408140470741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4226742.
The product of its (nonzero) digits is 100352, while the sum is 41.
Adding to 1408140470741 its reverse (1470740418041), we get a palindrome (2878880888782).
The spelling of 1408140470741 in words is "one trillion, four hundred eight billion, one hundred forty million, four hundred seventy thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •