Base | Representation |
---|---|
bin | 111110111001011000110… |
… | …011101101100000101101 |
3 | 120022012102102201212221101 |
4 | 332321120303231200231 |
5 | 1031303410111104131 |
6 | 13105334222003101 |
7 | 624161546514211 |
oct | 76713063554055 |
9 | 16265372655841 |
10 | 4322227050541 |
11 | 1417056542a24 |
12 | 599815116491 |
13 | 254779814c4a |
14 | 10d2a8446941 |
15 | 7766eb96c61 |
hex | 3ee58ced82d |
4322227050541 has 4 divisors (see below), whose sum is σ = 4549712684800. Its totient is φ = 4094741416284.
The previous prime is 4322227050539. The next prime is 4322227050551. The reversal of 4322227050541 is 1450507222234.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4322227050541 - 21 = 4322227050539 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4322227050541.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4322227050521) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 113742817101 + ... + 113742817138.
It is an arithmetic number, because the mean of its divisors is an integer number (1137428171200).
Almost surely, 24322227050541 is an apocalyptic number.
It is an amenable number.
4322227050541 is a deficient number, since it is larger than the sum of its proper divisors (227485634259).
4322227050541 is a wasteful number, since it uses less digits than its factorization.
4322227050541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 227485634258.
The product of its (nonzero) digits is 134400, while the sum is 37.
The spelling of 4322227050541 in words is "four trillion, three hundred twenty-two billion, two hundred twenty-seven million, fifty thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •