Base | Representation |
---|---|
bin | 1100010001001101111… |
… | …00010001001011000101 |
3 | 1111022010020202100210101 |
4 | 12020212330101023011 |
5 | 23401323343100242 |
6 | 521355000324101 |
7 | 42312436652425 |
oct | 6104674211305 |
9 | 1438106670711 |
10 | 421560128197 |
11 | 15286777a86a |
12 | 6984b773631 |
13 | 309a32cb650 |
14 | 16591760485 |
15 | ae745d99b7 |
hex | 6226f112c5 |
421560128197 has 4 divisors (see below), whose sum is σ = 453987830380. Its totient is φ = 389132426016.
The previous prime is 421560128177. The next prime is 421560128201. The reversal of 421560128197 is 791821065124.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 220668820516 + 200891307681 = 469754^2 + 448209^2 .
It is a cyclic number.
It is not a de Polignac number, because 421560128197 - 211 = 421560126149 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (421560128107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16213851072 + ... + 16213851097.
It is an arithmetic number, because the mean of its divisors is an integer number (113496957595).
Almost surely, 2421560128197 is an apocalyptic number.
It is an amenable number.
421560128197 is a deficient number, since it is larger than the sum of its proper divisors (32427702183).
421560128197 is a wasteful number, since it uses less digits than its factorization.
421560128197 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32427702182.
The product of its (nonzero) digits is 241920, while the sum is 46.
The spelling of 421560128197 in words is "four hundred twenty-one billion, five hundred sixty million, one hundred twenty-eight thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •