Base | Representation |
---|---|
bin | 11011010011111111100101… |
… | …100001011101001100000001 |
3 | 120202022110211001001212022212 |
4 | 123103333211201131030001 |
5 | 111221031204441320001 |
6 | 1103250530141311505 |
7 | 34205320225541144 |
oct | 3323774541351401 |
9 | 522273731055285 |
10 | 120121201120001 |
11 | 3530212a52a594 |
12 | 11580363265595 |
13 | 52044c440b223 |
14 | 2193c7bb1805b |
15 | dd4964cb87bb |
hex | 6d3fe585d301 |
120121201120001 has 4 divisors (see below), whose sum is σ = 120242413231104. Its totient is φ = 119999989008900.
The previous prime is 120121201119991. The next prime is 120121201120009. The reversal of 120121201120001 is 100021102121021.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 120121201120001 - 26 = 120121201119937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120121201120009) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 60606054065 + ... + 60606056046.
It is an arithmetic number, because the mean of its divisors is an integer number (30060603307776).
Almost surely, 2120121201120001 is an apocalyptic number.
It is an amenable number.
120121201120001 is a deficient number, since it is larger than the sum of its proper divisors (121212111103).
120121201120001 is an equidigital number, since it uses as much as digits as its factorization.
120121201120001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121212111102.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 120121201120001 its reverse (100021102121021), we get a palindrome (220142303241022).
The spelling of 120121201120001 in words is "one hundred twenty trillion, one hundred twenty-one billion, two hundred one million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •