Base | Representation |
---|---|
bin | 100000001100010010111… |
… | …010011001010110111111 |
3 | 21211111010210111000200112 |
4 | 200030102322121112333 |
5 | 242221114204034201 |
6 | 4412140553020235 |
7 | 315554003053436 |
oct | 40142272312677 |
9 | 7744123430615 |
10 | 2212225455551 |
11 | 783221662761 |
12 | 2b88b19b467b |
13 | 1307c56459c7 |
14 | 791024ba11d |
15 | 3c8298a90bb |
hex | 20312e995bf |
2212225455551 has 4 divisors (see below), whose sum is σ = 2212267995672. Its totient is φ = 2212182915432.
The previous prime is 2212225455521. The next prime is 2212225455593. The reversal of 2212225455551 is 1555545222122.
2212225455551 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2212225455551 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2212225455499 and 2212225455508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2212225455521) 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, 21191960 + ... + 21296093.
It is an arithmetic number, because the mean of its divisors is an integer number (553066998918).
Almost surely, 22212225455551 is an apocalyptic number.
2212225455551 is a deficient number, since it is larger than the sum of its proper divisors (42540121).
2212225455551 is an equidigital number, since it uses as much as digits as its factorization.
2212225455551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42540120.
The product of its digits is 400000, while the sum is 41.
The spelling of 2212225455551 in words is "two trillion, two hundred twelve billion, two hundred twenty-five million, four hundred fifty-five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •