Base | Representation |
---|---|
bin | 101111111001011101010111… |
… | …0110110110010000001111111 |
3 | 2001020202011200010000211022210 |
4 | 1133302322232312302001333 |
5 | 420210244424103430421 |
6 | 4052020421323311503 |
7 | 154512615120524454 |
oct | 13762725666620177 |
9 | 2036664603024283 |
10 | 421313455530111 |
11 | 112275040033841 |
12 | 3b30545397b593 |
13 | 151118c44b2751 |
14 | 76079740b782b |
15 | 33a94e331d576 |
hex | 17f2eaedb207f |
421313455530111 has 16 divisors (see below), whose sum is σ = 563329530338400. Its totient is φ = 280087235850240.
The previous prime is 421313455530103. The next prime is 421313455530127. The reversal of 421313455530111 is 111035554313124.
It is not a de Polignac number, because 421313455530111 - 23 = 421313455530103 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 421313455530111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (421313455532111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 88553140 + ... + 93189513.
It is an arithmetic number, because the mean of its divisors is an integer number (35208095646150).
Almost surely, 2421313455530111 is an apocalyptic number.
421313455530111 is a deficient number, since it is larger than the sum of its proper divisors (142016074808289).
421313455530111 is a wasteful number, since it uses less digits than its factorization.
421313455530111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181744826.
The product of its (nonzero) digits is 108000, while the sum is 39.
The spelling of 421313455530111 in words is "four hundred twenty-one trillion, three hundred thirteen billion, four hundred fifty-five million, five hundred thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •