Base | Representation |
---|---|
bin | 1010000100101011110111… |
… | …11011010110111100001101 |
3 | 2220102122011222202220020221 |
4 | 11002111323323112330031 |
5 | 10400411202212103001 |
6 | 115040044342311341 |
7 | 4444242006056503 |
oct | 502257373267415 |
9 | 86378158686227 |
10 | 22151225503501 |
11 | 7070311351986 |
12 | 2599080728551 |
13 | c48b0bc7b153 |
14 | 5681a714a673 |
15 | 28630e31a1a1 |
hex | 14257bed6f0d |
22151225503501 has 4 divisors (see below), whose sum is σ = 22256207615104. Its totient is φ = 22046243391900.
The previous prime is 22151225503411. The next prime is 22151225503507. The reversal of 22151225503501 is 10530552215122.
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 22151225503501 - 27 = 22151225503373 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 (22151225503507) 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, 52491055485 + ... + 52491055906.
It is an arithmetic number, because the mean of its divisors is an integer number (5564051903776).
Almost surely, 222151225503501 is an apocalyptic number.
It is an amenable number.
22151225503501 is a deficient number, since it is larger than the sum of its proper divisors (104982111603).
22151225503501 is a wasteful number, since it uses less digits than its factorization.
22151225503501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104982111602.
The product of its (nonzero) digits is 30000, while the sum is 34.
Adding to 22151225503501 its reverse (10530552215122), we get a palindrome (32681777718623).
The spelling of 22151225503501 in words is "twenty-two trillion, one hundred fifty-one billion, two hundred twenty-five million, five hundred three thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •