Base | Representation |
---|---|
bin | 11111100010000111010… |
… | …00000001010001100001 |
3 | 10211120121122000221202212 |
4 | 33301003220001101201 |
5 | 120222414334314131 |
6 | 2145423151251505 |
7 | 141164206535504 |
oct | 17610350012141 |
9 | 3746548027685 |
10 | 1083466323041 |
11 | 38854a547863 |
12 | 155b96819b95 |
13 | 7b22a5a847b |
14 | 3a6236d513b |
15 | 1d2b41dda2b |
hex | fc43a01461 |
1083466323041 has 4 divisors (see below), whose sum is σ = 1086535633092. Its totient is φ = 1080397012992.
The previous prime is 1083466323031. The next prime is 1083466323083. The reversal of 1083466323041 is 1403236643801.
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 553132825441 + 530333497600 = 743729^2 + 728240^2 .
It is a cyclic number.
It is not a de Polignac number, because 1083466323041 - 26 = 1083466322977 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 1083466323041.
It is not an unprimeable number, because it can be changed into a prime (1083466323011) 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, 1534654496 + ... + 1534655201.
It is an arithmetic number, because the mean of its divisors is an integer number (271633908273).
Almost surely, 21083466323041 is an apocalyptic number.
It is an amenable number.
1083466323041 is a deficient number, since it is larger than the sum of its proper divisors (3069310051).
1083466323041 is an equidigital number, since it uses as much as digits as its factorization.
1083466323041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3069310050.
The product of its (nonzero) digits is 248832, while the sum is 41.
The spelling of 1083466323041 in words is "one trillion, eighty-three billion, four hundred sixty-six million, three hundred twenty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •