Base | Representation |
---|---|
bin | 1100010101110011011… |
… | …00000100111000100111 |
3 | 1111112110211110020021000 |
4 | 12022321230010320213 |
5 | 23421344131244221 |
6 | 522443145524343 |
7 | 42430443450006 |
oct | 6127154047047 |
9 | 1445424406230 |
10 | 424022134311 |
11 | 153910493466 |
12 | 6a2181a36b3 |
13 | 30ca63b73b9 |
14 | 16746720c3d |
15 | b06a80ce26 |
hex | 62b9b04e27 |
424022134311 has 16 divisors (see below), whose sum is σ = 628747423200. Its totient is φ = 282426505344.
The previous prime is 424022134309. The next prime is 424022134343. The reversal of 424022134311 is 113431220424.
424022134311 is a `hidden beast` number, since 4 + 2 + 4 + 0 + 221 + 3 + 431 + 1 = 666.
It is not a de Polignac number, because 424022134311 - 21 = 424022134309 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (424022134511) 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 15 ways as a sum of consecutive naturals, for example, 7050546 + ... + 7110431.
It is an arithmetic number, because the mean of its divisors is an integer number (39296713950).
Almost surely, 2424022134311 is an apocalyptic number.
424022134311 is a deficient number, since it is larger than the sum of its proper divisors (204725288889).
424022134311 is a wasteful number, since it uses less digits than its factorization.
424022134311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14162095 (or 14162089 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 424022134311 its reverse (113431220424), we get a palindrome (537453354735).
The spelling of 424022134311 in words is "four hundred twenty-four billion, twenty-two million, one hundred thirty-four thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •