Base | Representation |
---|---|
bin | 11011010010001111110110… |
… | …000101110011110011111110 |
3 | 120201220000010100102111201111 |
4 | 123102033312011303303332 |
5 | 111212044444310013042 |
6 | 1103115444401432234 |
7 | 34163542046054353 |
oct | 3322176605636376 |
9 | 521800110374644 |
10 | 120001220001022 |
11 | 352662602a1018 |
12 | 1156105993b67a |
13 | 51c60b3104b79 |
14 | 218c1390c862a |
15 | dd17917e2517 |
hex | 6d23f6173cfe |
120001220001022 has 8 divisors (see below), whose sum is σ = 180038054977200. Its totient is φ = 59988535008624.
The previous prime is 120001220000983. The next prime is 120001220001023. The reversal of 120001220001022 is 220100022100021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 120001220000993 and 120001220001011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120001220001023) 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, 6037483522 + ... + 6037503397.
It is an arithmetic number, because the mean of its divisors is an integer number (22504756872150).
Almost surely, 2120001220001022 is an apocalyptic number.
120001220001022 is a deficient number, since it is larger than the sum of its proper divisors (60036834976178).
120001220001022 is a wasteful number, since it uses less digits than its factorization.
120001220001022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12074991890.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 120001220001022 its reverse (220100022100021), we get a palindrome (340101242101043).
The spelling of 120001220001022 in words is "one hundred twenty trillion, one billion, two hundred twenty million, one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •