Base | Representation |
---|---|
bin | 11110010111001010110… |
… | …00101100010101001011 |
3 | 10200201202112022110022001 |
4 | 33023211120230111023 |
5 | 114043014004304011 |
6 | 2115130431011431 |
7 | 135241140201052 |
oct | 17134530542513 |
9 | 3621675273261 |
10 | 1043230541131 |
11 | 372482497339 |
12 | 14a227969b77 |
13 | 774b7720cac |
14 | 386c7aad399 |
15 | 1c20bb807c1 |
hex | f2e562c54b |
1043230541131 has 8 divisors (see below), whose sum is σ = 1078680960000. Its totient is φ = 1007892486120.
The previous prime is 1043230541083. The next prime is 1043230541149. The reversal of 1043230541131 is 1311450323401.
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 1043230541131 - 217 = 1043230410059 is a prime.
It is a super-2 number, since 2×10432305411312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1043230541131.
It is not an unprimeable number, because it can be changed into a prime (1053230541131) 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, 28072081 + ... + 28109218.
It is an arithmetic number, because the mean of its divisors is an integer number (134835120000).
Almost surely, 21043230541131 is an apocalyptic number.
1043230541131 is a deficient number, since it is larger than the sum of its proper divisors (35450418869).
1043230541131 is an equidigital number, since it uses as much as digits as its factorization.
1043230541131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56181929.
The product of its (nonzero) digits is 4320, while the sum is 28.
Adding to 1043230541131 its reverse (1311450323401), we get a palindrome (2354680864532).
The spelling of 1043230541131 in words is "one trillion, forty-three billion, two hundred thirty million, five hundred forty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •