Base | Representation |
---|---|
bin | 11011010101010011001111… |
… | …001101001001100001001111 |
3 | 120202122001122202001002101022 |
4 | 123111103033031021201033 |
5 | 111224014132334323043 |
6 | 1103400103005304355 |
7 | 34214650110163505 |
oct | 3325231715114117 |
9 | 522561582032338 |
10 | 120211021011023 |
11 | 35337231514088 |
12 | 1159584b8650bb |
13 | 520cb09b1bb37 |
14 | 219835cb30675 |
15 | dd6e70419868 |
hex | 6d54cf34984f |
120211021011023 has 2 divisors, whose sum is σ = 120211021011024. Its totient is φ = 120211021011022.
The previous prime is 120211021011017. The next prime is 120211021011041. The reversal of 120211021011023 is 320110120112021.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 120211021011023 - 26 = 120211021010959 is a prime.
It is a super-2 number, since 2×1202110210110232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 120211021010992 and 120211021011010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120211021011043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60105510505511 + 60105510505512.
It is an arithmetic number, because the mean of its divisors is an integer number (60105510505512).
Almost surely, 2120211021011023 is an apocalyptic number.
120211021011023 is a deficient number, since it is larger than the sum of its proper divisors (1).
120211021011023 is an equidigital number, since it uses as much as digits as its factorization.
120211021011023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 120211021011023 its reverse (320110120112021), we get a palindrome (440321141123044).
The spelling of 120211021011023 in words is "one hundred twenty trillion, two hundred eleven billion, twenty-one million, eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •