Base | Representation |
---|---|
bin | 1100111000000101010… |
… | …1000011111010101110 |
3 | 210010222201111112100102 |
4 | 3032001111003322232 |
5 | 12111021024122110 |
6 | 245342432431102 |
7 | 21660603305336 |
oct | 3160125037256 |
9 | 703881445312 |
10 | 221213114030 |
11 | 858a80437a7 |
12 | 36a579a8492 |
13 | 17b2513035c |
14 | a9c754c0c6 |
15 | 5b4a96b5a5 |
hex | 3381543eae |
221213114030 has 8 divisors (see below), whose sum is σ = 398183605272. Its totient is φ = 88485245608.
The previous prime is 221213114027. The next prime is 221213114039. The reversal of 221213114030 is 30411312122.
221213114030 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 junction number, because it is equal to n+sod(n) for n = 221213113993 and 221213114011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221213114039) 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 3 ways as a sum of consecutive naturals, for example, 11060655692 + ... + 11060655711.
It is an arithmetic number, because the mean of its divisors is an integer number (49772950659).
Almost surely, 2221213114030 is an apocalyptic number.
221213114030 is a deficient number, since it is larger than the sum of its proper divisors (176970491242).
221213114030 is a wasteful number, since it uses less digits than its factorization.
221213114030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22121311410.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 221213114030 its reverse (30411312122), we get a palindrome (251624426152).
The spelling of 221213114030 in words is "two hundred twenty-one billion, two hundred thirteen million, one hundred fourteen thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •