Base | Representation |
---|---|
bin | 111011111110011100101… |
… | …100001001001100001101 |
3 | 112121000022120222220121002 |
4 | 323332130230021030031 |
5 | 1020011314112021131 |
6 | 12433220405150045 |
7 | 603524446555343 |
oct | 73763454111415 |
9 | 15530276886532 |
10 | 4121502454541 |
11 | 1349a1276305a |
12 | 5669369bb325 |
13 | 23b86b354354 |
14 | 1036a6027993 |
15 | 72322ce26cb |
hex | 3bf9cb0930d |
4121502454541 has 8 divisors (see below), whose sum is σ = 4142936980224. Its totient is φ = 4100115090960.
The previous prime is 4121502454477. The next prime is 4121502454567. The reversal of 4121502454541 is 1454542051214.
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 4121502454541 - 26 = 4121502454477 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4121502454495 and 4121502454504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4121502454571) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11615285 + ... + 11964858.
It is an arithmetic number, because the mean of its divisors is an integer number (517867122528).
Almost surely, 24121502454541 is an apocalyptic number.
It is an amenable number.
4121502454541 is a deficient number, since it is larger than the sum of its proper divisors (21434525683).
4121502454541 is a wasteful number, since it uses less digits than its factorization.
4121502454541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23581051.
The product of its (nonzero) digits is 128000, while the sum is 38.
The spelling of 4121502454541 in words is "four trillion, one hundred twenty-one billion, five hundred two million, four hundred fifty-four thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •