Base | Representation |
---|---|
bin | 11110010011000011101… |
… | …01001111111100101101 |
3 | 10200112001201020211020112 |
4 | 33021201311033330231 |
5 | 114024003444401131 |
6 | 2114123425025405 |
7 | 135132350123006 |
oct | 17114165177455 |
9 | 3615051224215 |
10 | 1041023434541 |
11 | 37154a653502 |
12 | 149910785265 |
13 | 772253a1a6c |
14 | 385589021ad |
15 | 1c12d00d02b |
hex | f261d4ff2d |
1041023434541 has 8 divisors (see below), whose sum is σ = 1049569516320. Its totient is φ = 1032501598128.
The previous prime is 1041023434531. The next prime is 1041023434559. The reversal of 1041023434541 is 1454343201401.
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-1041023434541 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1041023434498 and 1041023434507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1041023434531) 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, 5975111 + ... + 6146868.
It is an arithmetic number, because the mean of its divisors is an integer number (131196189540).
Almost surely, 21041023434541 is an apocalyptic number.
It is an amenable number.
1041023434541 is a deficient number, since it is larger than the sum of its proper divisors (8546081779).
1041023434541 is a wasteful number, since it uses less digits than its factorization.
1041023434541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12122683.
The product of its (nonzero) digits is 23040, while the sum is 32.
Adding to 1041023434541 its reverse (1454343201401), we get a palindrome (2495366635942).
The spelling of 1041023434541 in words is "one trillion, forty-one billion, twenty-three million, four hundred thirty-four thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •