Base | Representation |
---|---|
bin | 111111001100010010100… |
… | …110100101101110101001 |
3 | 120101010210222002220002110 |
4 | 333030102212211232221 |
5 | 1032121442123322103 |
6 | 13122532240552533 |
7 | 625510536220653 |
oct | 77142246455651 |
9 | 16333728086073 |
10 | 4342524042153 |
11 | 1424721681160 |
12 | 5a173a622749 |
13 | 2566628a625b |
14 | 110271d5b6d3 |
15 | 77e5ba2a403 |
hex | 3f3129a5ba9 |
4342524042153 has 16 divisors (see below), whose sum is σ = 6343507624896. Its totient is φ = 2620537328640.
The previous prime is 4342524042139. The next prime is 4342524042167. The reversal of 4342524042153 is 3512404252434.
It is an interprime number because it is at equal distance from previous prime (4342524042139) and next prime (4342524042167).
It is not a de Polignac number, because 4342524042153 - 24 = 4342524042137 is a prime.
It is not an unprimeable number, because it can be changed into a prime (4342524042113) 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 15 ways as a sum of consecutive naturals, for example, 282377800 + ... + 282393177.
It is an arithmetic number, because the mean of its divisors is an integer number (396469226556).
Almost surely, 24342524042153 is an apocalyptic number.
It is an amenable number.
4342524042153 is a deficient number, since it is larger than the sum of its proper divisors (2000983582743).
4342524042153 is a wasteful number, since it uses less digits than its factorization.
4342524042153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 564771224.
The product of its (nonzero) digits is 460800, while the sum is 39.
Adding to 4342524042153 its reverse (3512404252434), we get a palindrome (7854928294587).
The spelling of 4342524042153 in words is "four trillion, three hundred forty-two billion, five hundred twenty-four million, forty-two thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •