Base | Representation |
---|---|
bin | 10100110010111111… |
… | …101110000111000101 |
3 | 2010122020120220202002 |
4 | 110302333232013011 |
5 | 331213040314341 |
6 | 14131453555045 |
7 | 1420240164362 |
oct | 246277560705 |
9 | 63566526662 |
10 | 22330401221 |
11 | 9519a24a47 |
12 | 43b24a5a85 |
13 | 214b43557b |
14 | 111b9c9469 |
15 | 8aa64529b |
hex | 532fee1c5 |
22330401221 has 8 divisors (see below), whose sum is σ = 23666257944. Its totient is φ = 20997022720.
The previous prime is 22330401169. The next prime is 22330401227. The reversal of 22330401221 is 12210403322.
It can be written as a sum of positive squares in 4 ways, for example, as 11553885121 + 10776516100 = 107489^2 + 103810^2 .
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 22330401221 - 226 = 22263292357 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22330401193 and 22330401202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22330401227) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 600980 + ... + 637053.
It is an arithmetic number, because the mean of its divisors is an integer number (2958282243).
Almost surely, 222330401221 is an apocalyptic number.
It is an amenable number.
22330401221 is a deficient number, since it is larger than the sum of its proper divisors (1335856723).
22330401221 is a wasteful number, since it uses less digits than its factorization.
22330401221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1239111.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 22330401221 its reverse (12210403322), we get a palindrome (34540804543).
The spelling of 22330401221 in words is "twenty-two billion, three hundred thirty million, four hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •