Base | Representation |
---|---|
bin | 11000101001011111… |
… | …11110010100001101 |
3 | 1021011020021011212010 |
4 | 30110233332110031 |
5 | 204100123202341 |
6 | 10025033331433 |
7 | 645632555466 |
oct | 142457762415 |
9 | 37136234763 |
10 | 13233022221 |
11 | 5680772501 |
12 | 2693866b79 |
13 | 132b74b783 |
14 | 8d76a5d6d |
15 | 526b30716 |
hex | 314bfe50d |
13233022221 has 8 divisors (see below), whose sum is σ = 17885728960. Its totient is φ = 8701165152.
The previous prime is 13233022217. The next prime is 13233022279. The reversal of 13233022221 is 12222033231.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13233022221 - 22 = 13233022217 is a prime.
It is a super-2 number, since 2×132330222212 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13233022291) 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, 30212161 + ... + 30212598.
It is an arithmetic number, because the mean of its divisors is an integer number (2235716120).
Almost surely, 213233022221 is an apocalyptic number.
It is an amenable number.
13233022221 is a deficient number, since it is larger than the sum of its proper divisors (4652706739).
13233022221 is an equidigital number, since it uses as much as digits as its factorization.
13233022221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60424835.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 13233022221 its reverse (12222033231), we get a palindrome (25455055452).
The spelling of 13233022221 in words is "thirteen billion, two hundred thirty-three million, twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •