Base | Representation |
---|---|
bin | 1010000111100011110111… |
… | …00011010100101010110111 |
3 | 2220210002010222220112000021 |
4 | 11003301323203110222313 |
5 | 10404021001340404201 |
6 | 115153302132430011 |
7 | 4454336553550432 |
oct | 503617343245267 |
9 | 86702128815007 |
10 | 22250003450551 |
11 | 70a919a989568 |
12 | 25b4249178307 |
13 | c55221544726 |
14 | 56cc97b7a819 |
15 | 288b9110eea1 |
hex | 143c7b8d4ab7 |
22250003450551 has 8 divisors (see below), whose sum is σ = 22313426516640. Its totient is φ = 22186588414848.
The previous prime is 22250003450537. The next prime is 22250003450569. The reversal of 22250003450551 is 15505430005222.
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 22250003450551 - 215 = 22250003417783 is a prime.
It is a super-4 number, since 4×222500034505514 (a number of 54 digits) contains 4444 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22250003450651) 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, 3563755 + ... + 7563091.
It is an arithmetic number, because the mean of its divisors is an integer number (2789178314580).
Almost surely, 222250003450551 is an apocalyptic number.
22250003450551 is a deficient number, since it is larger than the sum of its proper divisors (63423066089).
22250003450551 is a wasteful number, since it uses less digits than its factorization.
22250003450551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4015193.
The product of its (nonzero) digits is 60000, while the sum is 34.
Adding to 22250003450551 its reverse (15505430005222), we get a palindrome (37755433455773).
The spelling of 22250003450551 in words is "twenty-two trillion, two hundred fifty billion, three million, four hundred fifty thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •