Base | Representation |
---|---|
bin | 1100111000000101110… |
… | …1000111010110100011 |
3 | 210010222212110210101210 |
4 | 3032001131013112203 |
5 | 12111022044202001 |
6 | 245342550001203 |
7 | 21660630250446 |
oct | 3160135072643 |
9 | 703885423353 |
10 | 221215225251 |
11 | 858a9255a09 |
12 | 36a58646203 |
13 | 17b256bc2b7 |
14 | a9c793b65d |
15 | 5b4ac36dd6 |
hex | 33817475a3 |
221215225251 has 8 divisors (see below), whose sum is σ = 294957777600. Its totient is φ = 147474744872.
The previous prime is 221215225247. The next prime is 221215225303. The reversal of 221215225251 is 152522512122.
221215225251 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 221215225251 - 22 = 221215225247 is a prime.
It is not an unprimeable number, because it can be changed into a prime (221215226251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 248901 + ... + 710198.
It is an arithmetic number, because the mean of its divisors is an integer number (36869722200).
Almost surely, 2221215225251 is an apocalyptic number.
221215225251 is a deficient number, since it is larger than the sum of its proper divisors (73742552349).
221215225251 is an equidigital number, since it uses as much as digits as its factorization.
221215225251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1035985.
The product of its digits is 8000, while the sum is 30.
Adding to 221215225251 its reverse (152522512122), we get a palindrome (373737737373).
The spelling of 221215225251 in words is "two hundred twenty-one billion, two hundred fifteen million, two hundred twenty-five thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •