Base | Representation |
---|---|
bin | 111100010000101000101… |
… | …000010010001110110111 |
3 | 112122212201111202012222200 |
4 | 330100220220102032313 |
5 | 1020321312202404143 |
6 | 12450210222555543 |
7 | 605115405161565 |
oct | 74205050221667 |
9 | 15585644665880 |
10 | 4141030122423 |
11 | 1357223602a57 |
12 | 56a686738bb3 |
13 | 240660c1350c |
14 | 1045d96baa35 |
15 | 72ab735d1d3 |
hex | 3c428a123b7 |
4141030122423 has 6 divisors (see below), whose sum is σ = 5981487954624. Its totient is φ = 2760686748276.
The previous prime is 4141030122421. The next prime is 4141030122461. The reversal of 4141030122423 is 3242210301414.
4141030122423 is a `hidden beast` number, since 4 + 1 + 410 + 3 + 0 + 1 + 2 + 242 + 3 = 666.
It is not a de Polignac number, because 4141030122423 - 21 = 4141030122421 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4141030122421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 230057229015 + ... + 230057229032.
It is an arithmetic number, because the mean of its divisors is an integer number (996914659104).
Almost surely, 24141030122423 is an apocalyptic number.
4141030122423 is a deficient number, since it is larger than the sum of its proper divisors (1840457832201).
4141030122423 is a wasteful number, since it uses less digits than its factorization.
4141030122423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 460114458053 (or 460114458050 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 4141030122423 its reverse (3242210301414), we get a palindrome (7383240423837).
The spelling of 4141030122423 in words is "four trillion, one hundred forty-one billion, thirty million, one hundred twenty-two thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •