Base | Representation |
---|---|
bin | 101111111111011010101011… |
… | …0000110111010111111110001 |
3 | 2001100122110021011102020201010 |
4 | 1133332311112012322333301 |
5 | 420312203430131424244 |
6 | 4053444523124501133 |
7 | 154626024022221552 |
oct | 13776652606727761 |
9 | 2040573234366633 |
10 | 422132305342449 |
11 | 11256033a443539 |
12 | 3b41809ab4a7a9 |
13 | 15170ba0763420 |
14 | 7635453a80329 |
15 | 33c096b3ceeb9 |
hex | 17fed561baff1 |
422132305342449 has 32 divisors (see below), whose sum is σ = 625693792697344. Its totient is φ = 251393030058240.
The previous prime is 422132305342313. The next prime is 422132305342453. The reversal of 422132305342449 is 944243503231224.
It is not a de Polignac number, because 422132305342449 - 211 = 422132305340401 is a prime.
It is a super-2 number, since 2×4221323053424492 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 422132305342398 and 422132305342407.
It is not an unprimeable number, because it can be changed into a prime (422132305347449) 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, 511329447 + ... + 512154339.
It is an arithmetic number, because the mean of its divisors is an integer number (19552931021792).
Almost surely, 2422132305342449 is an apocalyptic number.
It is an amenable number.
422132305342449 is a deficient number, since it is larger than the sum of its proper divisors (203561487354895).
422132305342449 is a wasteful number, since it uses less digits than its factorization.
422132305342449 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1248217.
The product of its (nonzero) digits is 4976640, while the sum is 48.
The spelling of 422132305342449 in words is "four hundred twenty-two trillion, one hundred thirty-two billion, three hundred five million, three hundred forty-two thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.993 sec. • engine limits •