Base | Representation |
---|---|
bin | 1100110111011000000… |
… | …1000011101111000110 |
3 | 210010111111101001022001 |
4 | 3031312001003233012 |
5 | 12110123432233110 |
6 | 245311532455514 |
7 | 21653110142101 |
oct | 3156601035706 |
9 | 703444331261 |
10 | 221023321030 |
11 | 8580a9a2486 |
12 | 36a0431a59a |
13 | 17ac4a0abc5 |
14 | a9aa265738 |
15 | 5b38e7b63a |
hex | 3376043bc6 |
221023321030 has 128 divisors (see below), whose sum is σ = 440731238400. Its totient is φ = 79432214400.
The previous prime is 221023321021. The next prime is 221023321037. The reversal of 221023321030 is 30123320122.
221023321030 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a junction number, because it is equal to n+sod(n) for n = 221023320989 and 221023321007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221023321037) 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 63 ways as a sum of consecutive naturals, for example, 450149085 + ... + 450149575.
It is an arithmetic number, because the mean of its divisors is an integer number (3443212800).
Almost surely, 2221023321030 is an apocalyptic number.
221023321030 is a deficient number, since it is larger than the sum of its proper divisors (219707917370).
221023321030 is a wasteful number, since it uses less digits than its factorization.
221023321030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1210.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 221023321030 its reverse (30123320122), we get a palindrome (251146641152).
The spelling of 221023321030 in words is "two hundred twenty-one billion, twenty-three million, three hundred twenty-one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •