Base | Representation |
---|---|
bin | 10000100110101011000… |
… | …011000110110001010101 |
3 | 11001002012202122011202112 |
4 | 100212223003012301111 |
5 | 122143320212122131 |
6 | 2232103522320405 |
7 | 145302636260531 |
oct | 20465303066125 |
9 | 4032182564675 |
10 | 1141036051541 |
11 | 3aaa02116981 |
12 | 1651827b9105 |
13 | 837a36ab289 |
14 | 3d3254c8bc1 |
15 | 1ea333db02b |
hex | 109ab0c6c55 |
1141036051541 has 8 divisors (see below), whose sum is σ = 1142343103320. Its totient is φ = 1139729488128.
The previous prime is 1141036051471. The next prime is 1141036051567. The reversal of 1141036051541 is 1451506301411.
It can be written as a sum of positive squares in 4 ways, for example, as 407974735441 + 733061316100 = 638729^2 + 856190^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 1141036051541 - 222 = 1141031857237 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1141036051498 and 1141036051507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1141036056541) 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, 4660265 + ... + 4898993.
It is an arithmetic number, because the mean of its divisors is an integer number (142792887915).
Almost surely, 21141036051541 is an apocalyptic number.
It is an amenable number.
1141036051541 is a deficient number, since it is larger than the sum of its proper divisors (1307051779).
1141036051541 is a wasteful number, since it uses less digits than its factorization.
1141036051541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 244183.
The product of its (nonzero) digits is 7200, while the sum is 32.
The spelling of 1141036051541 in words is "one trillion, one hundred forty-one billion, thirty-six million, fifty-one thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •