Base | Representation |
---|---|
bin | 10100111101111101… |
… | …110100001010111101 |
3 | 2011010001220121202111 |
4 | 110331331310022331 |
5 | 332102144414013 |
6 | 14202030454021 |
7 | 1424633451136 |
oct | 247575641275 |
9 | 64101817674 |
10 | 22514451133 |
11 | 9603903409 |
12 | 4444064311 |
13 | 217a5c6945 |
14 | 1138218c8d |
15 | 8bb89d73d |
hex | 53df742bd |
22514451133 has 8 divisors (see below), whose sum is σ = 22538487800. Its totient is φ = 22490431488.
The previous prime is 22514451131. The next prime is 22514451137. The reversal of 22514451133 is 33115441522.
It can be written as a sum of positive squares in 4 ways, for example, as 46539684 + 22467911449 = 6822^2 + 149893^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22514451133 - 21 = 22514451131 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22514451095 and 22514451104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22514451131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6970963 + ... + 6974191.
It is an arithmetic number, because the mean of its divisors is an integer number (2817310975).
Almost surely, 222514451133 is an apocalyptic number.
It is an amenable number.
22514451133 is a deficient number, since it is larger than the sum of its proper divisors (24036667).
22514451133 is a wasteful number, since it uses less digits than its factorization.
22514451133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8511.
The product of its digits is 14400, while the sum is 31.
Adding to 22514451133 its reverse (33115441522), we get a palindrome (55629892655).
The spelling of 22514451133 in words is "twenty-two billion, five hundred fourteen million, four hundred fifty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •