Base | Representation |
---|---|
bin | 10000100110101011010… |
… | …011110100000011000101 |
3 | 11001002020001212200122212 |
4 | 100212223103310003011 |
5 | 122143322322300201 |
6 | 2232104200233205 |
7 | 145303021431521 |
oct | 20465323640305 |
9 | 4032201780585 |
10 | 1141040431301 |
11 | 3aaa04638511 |
12 | 16518416b805 |
13 | 837a4582954 |
14 | 3d325d08d81 |
15 | 1ea339a3abb |
hex | 109ab4f40c5 |
1141040431301 has 8 divisors (see below), whose sum is σ = 1199737255800. Its totient is φ = 1083633647040.
The previous prime is 1141040431211. The next prime is 1141040431357. The reversal of 1141040431301 is 1031340401411.
It can be written as a sum of positive squares in 4 ways, for example, as 85541040676 + 1055499390625 = 292474^2 + 1027375^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1141040431301 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1141040433301) 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, 322508246 + ... + 322511783.
It is an arithmetic number, because the mean of its divisors is an integer number (149967156975).
Almost surely, 21141040431301 is an apocalyptic number.
It is an amenable number.
1141040431301 is a deficient number, since it is larger than the sum of its proper divisors (58696824499).
1141040431301 is an equidigital number, since it uses as much as digits as its factorization.
1141040431301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 645020119.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 1141040431301 its reverse (1031340401411), we get a palindrome (2172380832712).
The spelling of 1141040431301 in words is "one trillion, one hundred forty-one billion, forty million, four hundred thirty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •