Base | Representation |
---|---|
bin | 101111111011000010011001… |
… | …0100010101100101010001101 |
3 | 2001021111220200021012112122210 |
4 | 1133312010302202230222031 |
5 | 420222323241241110131 |
6 | 4052304222023501033 |
7 | 154534365412504140 |
oct | 13766046242545215 |
9 | 2037456607175583 |
10 | 421530413222541 |
11 | 112349053a97287 |
12 | 3b33b5025b7779 |
13 | 151291bbb0104c |
14 | 76142763c4057 |
15 | 33aee903ae146 |
hex | 17f61328aca8d |
421530413222541 has 32 divisors (see below), whose sum is σ = 676169552450560. Its totient is φ = 228186606905856.
The previous prime is 421530413222537. The next prime is 421530413222587. The reversal of 421530413222541 is 145222314035124.
It is not a de Polignac number, because 421530413222541 - 22 = 421530413222537 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 421530413222541.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (421530413222591) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15014596 + ... + 32687901.
It is an arithmetic number, because the mean of its divisors is an integer number (21130298514080).
Almost surely, 2421530413222541 is an apocalyptic number.
It is an amenable number.
421530413222541 is a deficient number, since it is larger than the sum of its proper divisors (254639139228019).
421530413222541 is a wasteful number, since it uses less digits than its factorization.
421530413222541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47724673.
The product of its (nonzero) digits is 230400, while the sum is 39.
Adding to 421530413222541 its reverse (145222314035124), we get a palindrome (566752727257665).
The spelling of 421530413222541 in words is "four hundred twenty-one trillion, five hundred thirty billion, four hundred thirteen million, two hundred twenty-two thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •