Base | Representation |
---|---|
bin | 11011100000110011001011… |
… | …100000101010111000011011 |
3 | 120212102121022222022110012122 |
4 | 123200303023200222320123 |
5 | 111324441011122031021 |
6 | 1105203110554531455 |
7 | 34326023232242225 |
oct | 3340631340527033 |
9 | 525377288273178 |
10 | 121001233002011 |
11 | 3561137559682a |
12 | 116a2a24136b8b |
13 | 52694a0ca31ab |
14 | 21c46c3157415 |
15 | dec7be275bab |
hex | 6e0ccb82ae1b |
121001233002011 has 8 divisors (see below), whose sum is σ = 121628669043024. Its totient is φ = 120373930462240.
The previous prime is 121001233002007. The next prime is 121001233002037. The reversal of 121001233002011 is 110200332100121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 121001233002011 - 22 = 121001233002007 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121001233005011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31557620 + ... + 35183601.
It is an arithmetic number, because the mean of its divisors is an integer number (15203583630378).
Almost surely, 2121001233002011 is an apocalyptic number.
121001233002011 is a deficient number, since it is larger than the sum of its proper divisors (627436041013).
121001233002011 is an equidigital number, since it uses as much as digits as its factorization.
121001233002011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66750621.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 121001233002011 its reverse (110200332100121), we get a palindrome (231201565102132).
The spelling of 121001233002011 in words is "one hundred twenty-one trillion, one billion, two hundred thirty-three million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •