Base | Representation |
---|---|
bin | 10001110000001110110… |
… | …111110101011111110101 |
3 | 11022122002022022011202101 |
4 | 101300032313311133311 |
5 | 124442100134331013 |
6 | 2332245231342101 |
7 | 154100144564635 |
oct | 21601667653765 |
9 | 4278068264671 |
10 | 1220020230133 |
11 | 430453683331 |
12 | 178546381931 |
13 | 8b080226723 |
14 | 430993986c5 |
15 | 21b076008dd |
hex | 11c0edf57f5 |
1220020230133 has 8 divisors (see below), whose sum is σ = 1237341744000. Its totient is φ = 1202702553360.
The previous prime is 1220020230127. The next prime is 1220020230173. The reversal of 1220020230133 is 3310320200221.
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 1220020230133 - 29 = 1220020229621 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1220020230133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220020230173) 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, 315810 + ... + 1593667.
It is an arithmetic number, because the mean of its divisors is an integer number (154667718000).
Almost surely, 21220020230133 is an apocalyptic number.
It is an amenable number.
1220020230133 is a deficient number, since it is larger than the sum of its proper divisors (17321513867).
1220020230133 is an equidigital number, since it uses as much as digits as its factorization.
1220020230133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1918547.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 1220020230133 its reverse (3310320200221), we get a palindrome (4530340430354).
The spelling of 1220020230133 in words is "one trillion, two hundred twenty billion, twenty million, two hundred thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •