Base | Representation |
---|---|
bin | 11011010110101001001011… |
… | …011101111110011010111100 |
3 | 120202221212211211110000120022 |
4 | 123112221023131332122330 |
5 | 111232022124312010022 |
6 | 1103510323442511312 |
7 | 34224424632450515 |
oct | 3326511335763274 |
9 | 522855754400508 |
10 | 120303300110012 |
11 | 3537238567aa58 |
12 | 115ab703965538 |
13 | 5218724b789a6 |
14 | 219c9d45b9a0c |
15 | dd95718d9c42 |
hex | 6d6a4b77e6bc |
120303300110012 has 12 divisors (see below), whose sum is σ = 217322090521536. Its totient is φ = 58211274246720.
The previous prime is 120303300109969. The next prime is 120303300110017. The reversal of 120303300110012 is 210011003303021.
It is a super-2 number, since 2×1203033001100122 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120303300110017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 485093951933 + ... + 485093952180.
It is an arithmetic number, because the mean of its divisors is an integer number (18110174210128).
Almost surely, 2120303300110012 is an apocalyptic number.
It is an amenable number.
120303300110012 is a deficient number, since it is larger than the sum of its proper divisors (97018790411524).
120303300110012 is a wasteful number, since it uses less digits than its factorization.
120303300110012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 970187904148 (or 970187904146 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 120303300110012 its reverse (210011003303021), we get a palindrome (330314303413033).
The spelling of 120303300110012 in words is "one hundred twenty trillion, three hundred three billion, three hundred million, one hundred ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •