Base | Representation |
---|---|
bin | 11110011110101110110… |
… | …11101101110001010011 |
3 | 10201010020112120110111011 |
4 | 33033113123231301103 |
5 | 114124323100412411 |
6 | 2121041413431351 |
7 | 135443600121214 |
oct | 17172733556123 |
9 | 3633215513434 |
10 | 1047291419731 |
11 | 374176781557 |
12 | 14ab7b93b557 |
13 | 779b3b3953b |
14 | 3899114d40b |
15 | 1c39842dc21 |
hex | f3d76edc53 |
1047291419731 has 4 divisors (see below), whose sum is σ = 1047294903600. Its totient is φ = 1047287935864.
The previous prime is 1047291419729. The next prime is 1047291419737. The reversal of 1047291419731 is 1379141927401.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1047291419731 - 21 = 1047291419729 is a prime.
It is a super-2 number, since 2×10472914197312 (a number of 25 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (49) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1047291419737) 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, 1243471 + ... + 1908088.
It is an arithmetic number, because the mean of its divisors is an integer number (261823725900).
Almost surely, 21047291419731 is an apocalyptic number.
1047291419731 is a deficient number, since it is larger than the sum of its proper divisors (3483869).
1047291419731 is an equidigital number, since it uses as much as digits as its factorization.
1047291419731 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3483868.
The product of its (nonzero) digits is 381024, while the sum is 49.
The spelling of 1047291419731 in words is "one trillion, forty-seven billion, two hundred ninety-one million, four hundred nineteen thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •