Base | Representation |
---|---|
bin | 11111100100100011000… |
… | …10000010010000010001 |
3 | 10211200222201111011210021 |
4 | 33302101202002100101 |
5 | 120233103441031131 |
6 | 2150201002103441 |
7 | 141241460365534 |
oct | 17622142022021 |
9 | 3750881434707 |
10 | 1084773377041 |
11 | 389060322882 |
12 | 1562a04aab81 |
13 | 7b3a83130c3 |
14 | 3a709130a1b |
15 | 1d33dd23e11 |
hex | fc91882411 |
1084773377041 has 8 divisors (see below), whose sum is σ = 1085848499880. Its totient is φ = 1083698458752.
The previous prime is 1084773376933. The next prime is 1084773377053. The reversal of 1084773377041 is 1407733774801.
It can be written as a sum of positive squares in 4 ways, for example, as 33935166225 + 1050838210816 = 184215^2 + 1025104^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 1084773377041 - 215 = 1084773344273 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1084773377041.
It is not an unprimeable number, because it can be changed into a prime (1084773377081) 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, 11936811 + ... + 12027343.
It is an arithmetic number, because the mean of its divisors is an integer number (135731062485).
Almost surely, 21084773377041 is an apocalyptic number.
It is an amenable number.
1084773377041 is a deficient number, since it is larger than the sum of its proper divisors (1075122839).
1084773377041 is a wasteful number, since it uses less digits than its factorization.
1084773377041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102275.
The product of its (nonzero) digits is 2765952, while the sum is 52.
The spelling of 1084773377041 in words is "one trillion, eighty-four billion, seven hundred seventy-three million, three hundred seventy-seven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •