Base | Representation |
---|---|
bin | 11011010011111110100101… |
… | …001001001010101101001111 |
3 | 120202022101000202122122100122 |
4 | 123103332211021022231033 |
5 | 111221022001434323043 |
6 | 1103250231035015155 |
7 | 34205251402011320 |
oct | 3323764511125517 |
9 | 522271022578318 |
10 | 120120121011023 |
11 | 35301725870741 |
12 | 1158010159a4bb |
13 | 52043817031a3 |
14 | 2193bb84b6447 |
15 | dd4900061368 |
hex | 6d3fa524ab4f |
120120121011023 has 16 divisors (see below), whose sum is σ = 143661660894720. Its totient is φ = 98199763084896.
The previous prime is 120120121010971. The next prime is 120120121011049. The reversal of 120120121011023 is 320110121021021.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 120120121011023 - 26 = 120120121010959 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120120121010992 and 120120121011010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120120121091023) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1074998468 + ... + 1075110201.
It is an arithmetic number, because the mean of its divisors is an integer number (8978853805920).
Almost surely, 2120120121011023 is an apocalyptic number.
120120121011023 is a deficient number, since it is larger than the sum of its proper divisors (23541539883697).
120120121011023 is a wasteful number, since it uses less digits than its factorization.
120120121011023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2150109046.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 120120121011023 its reverse (320110121021021), we get a palindrome (440230242032044).
The spelling of 120120121011023 in words is "one hundred twenty trillion, one hundred twenty billion, one hundred twenty-one million, eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •