Base | Representation |
---|---|
bin | 11011100011110110100011… |
… | …010100000011000011010000 |
3 | 120220011122210211111210210211 |
4 | 123203312203110003003100 |
5 | 111341410123033031000 |
6 | 1105443323054533504 |
7 | 34350130605311254 |
oct | 3343664324030320 |
9 | 526148724453724 |
10 | 121211012002000 |
11 | 356923353463a8 |
12 | 1171760a807294 |
13 | 52831c3281b9b |
14 | 21d0903cb0264 |
15 | e02e9aea17ba |
hex | 6e3da35030d0 |
121211012002000 has 40 divisors (see below), whose sum is σ = 293088227025672. Its totient is φ = 48484404800000.
The previous prime is 121211012001977. The next prime is 121211012002021. The reversal of 121211012002000 is 200210112121.
It can be written as a sum of positive squares in 4 ways, for example, as 5471800499344 + 115739211502656 = 2339188^2 + 10758216^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30302751001 + ... + 30302755000.
Almost surely, 2121211012002000 is an apocalyptic number.
121211012002000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121211012002000 is an abundant number, since it is smaller than the sum of its proper divisors (171877215023672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121211012002000 is an equidigital number, since it uses as much as digits as its factorization.
121211012002000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60605506024 (or 60605506008 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 121211012002000 its reverse (200210112121), we get a palindrome (121411222114121).
The spelling of 121211012002000 in words is "one hundred twenty-one trillion, two hundred eleven billion, twelve million, two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •