Base | Representation |
---|---|
bin | 10001110010001011100… |
… | …111100111111100101010 |
3 | 11022211111011110121211120 |
4 | 101302023213213330222 |
5 | 130010341430213310 |
6 | 2333233033440110 |
7 | 154203050140416 |
oct | 21621347477452 |
9 | 4284434417746 |
10 | 1222113132330 |
11 | 431328003772 |
12 | 178a2b270036 |
13 | 8b3249ca9ac |
14 | 43217317d46 |
15 | 21bcb214b70 |
hex | 11c8b9e7f2a |
1222113132330 has 32 divisors (see below), whose sum is σ = 2933165836224. Its totient is φ = 325886355456.
The previous prime is 1222113132283. The next prime is 1222113132347. The reversal of 1222113132330 is 332313112221.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1222113132330.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 317137 + ... + 1595243.
It is an arithmetic number, because the mean of its divisors is an integer number (91661432382).
Almost surely, 21222113132330 is an apocalyptic number.
1222113132330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1222113132330 is an abundant number, since it is smaller than the sum of its proper divisors (1711052703894).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1222113132330 is a wasteful number, since it uses less digits than its factorization.
1222113132330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1309990.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 1222113132330 its reverse (332313112221), we get a palindrome (1554426244551).
The spelling of 1222113132330 in words is "one trillion, two hundred twenty-two billion, one hundred thirteen million, one hundred thirty-two thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •