Base | Representation |
---|---|
bin | 11111010010001000001… |
… | …01000100110011110001 |
3 | 10210202110111220000211121 |
4 | 33221010011010303301 |
5 | 120102330301130410 |
6 | 2141443410342241 |
7 | 140441425202431 |
oct | 17510405046361 |
9 | 3722414800747 |
10 | 1074884005105 |
11 | 384945aa9319 |
12 | 1543a058a981 |
13 | 7a49051ab31 |
14 | 3a04b9682c1 |
15 | 1ce60a199da |
hex | fa44144cf1 |
1074884005105 has 8 divisors (see below), whose sum is σ = 1314197802792. Its totient is φ = 843682539648.
The previous prime is 1074884005093. The next prime is 1074884005157. The reversal of 1074884005105 is 5015004884701.
It can be written as a sum of positive squares in 4 ways, for example, as 62179910881 + 1012704094224 = 249359^2 + 1006332^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1074884005105 - 211 = 1074884003057 is a prime.
It is a super-2 number, since 2×10748840051052 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2028082764 + ... + 2028083293.
It is an arithmetic number, because the mean of its divisors is an integer number (164274725349).
Almost surely, 21074884005105 is an apocalyptic number.
It is an amenable number.
1074884005105 is a deficient number, since it is larger than the sum of its proper divisors (239313797687).
1074884005105 is an equidigital number, since it uses as much as digits as its factorization.
1074884005105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4056166115.
The product of its (nonzero) digits is 179200, while the sum is 43.
Adding to 1074884005105 its reverse (5015004884701), we get a palindrome (6089888889806).
The spelling of 1074884005105 in words is "one trillion, seventy-four billion, eight hundred eighty-four million, five thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •