Base | Representation |
---|---|
bin | 10001101000110111011… |
… | …100111110101001101001 |
3 | 11021212200002220210200112 |
4 | 101220313130332221221 |
5 | 124324400421333001 |
6 | 2324500335544105 |
7 | 153400146350504 |
oct | 21506734765151 |
9 | 4255602823615 |
10 | 1212111121001 |
11 | 428065145600 |
12 | 176ab968b035 |
13 | 8a3bc787bb1 |
14 | 42948bd013b |
15 | 217e30aacbb |
hex | 11a3773ea69 |
1212111121001 has 12 divisors (see below), whose sum is σ = 1332808702512. Its totient is φ = 1101515415000.
The previous prime is 1212111120923. The next prime is 1212111121027. The reversal of 1212111121001 is 1001211112121.
It is not a de Polignac number, because 1212111121001 - 230 = 1211037379177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1212111121301) 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 11 ways as a sum of consecutive naturals, for example, 1503575 + ... + 2164476.
It is an arithmetic number, because the mean of its divisors is an integer number (111067391876).
Almost surely, 21212111121001 is an apocalyptic number.
1212111121001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1212111121001 is a deficient number, since it is larger than the sum of its proper divisors (120697581511).
1212111121001 is a wasteful number, since it uses less digits than its factorization.
1212111121001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3670804 (or 3670793 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 1212111121001 its reverse (1001211112121), we get a palindrome (2213322233122).
The spelling of 1212111121001 in words is "one trillion, two hundred twelve billion, one hundred eleven million, one hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •