Base | Representation |
---|---|
bin | 11011010010100011010100… |
… | …100111000100100000100111 |
3 | 120201222000002211011121020021 |
4 | 123102203110213010200213 |
5 | 111212420312040200203 |
6 | 1103133223510420011 |
7 | 34165212226534564 |
oct | 3322432447044047 |
9 | 521860084147207 |
10 | 120022133131303 |
11 | 35274112200367 |
12 | 11565115661607 |
13 | 51c8066a22780 |
14 | 218d16078786b |
15 | dd20b77d05bd |
hex | 6d28d49c4827 |
120022133131303 has 32 divisors (see below), whose sum is σ = 140961641103360. Its totient is φ = 101316178615680.
The previous prime is 120022133131261. The next prime is 120022133131309. The reversal of 120022133131303 is 303131331220021.
It is a cyclic number.
It is not a de Polignac number, because 120022133131303 - 221 = 120022131034151 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120022133131309) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 108702975 + ... + 109801552.
It is an arithmetic number, because the mean of its divisors is an integer number (4405051284480).
Almost surely, 2120022133131303 is an apocalyptic number.
120022133131303 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
120022133131303 is a deficient number, since it is larger than the sum of its proper divisors (20939507972057).
120022133131303 is a wasteful number, since it uses less digits than its factorization.
120022133131303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218504647.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 120022133131303 its reverse (303131331220021), we get a palindrome (423153464351324).
The spelling of 120022133131303 in words is "one hundred twenty trillion, twenty-two billion, one hundred thirty-three million, one hundred thirty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •