Base | Representation |
---|---|
bin | 10001100111110111000… |
… | …000111100101101101101 |
3 | 11021202212202122202022000 |
4 | 101213313000330231231 |
5 | 124320142141444323 |
6 | 2324201200242513 |
7 | 153331311264312 |
oct | 21476700745555 |
9 | 4252782582260 |
10 | 1211030031213 |
11 | 42765a976872 |
12 | 176857610439 |
13 | 8a2797c85b2 |
14 | 428853b4d09 |
15 | 2177d20ce43 |
hex | 119f703cb6d |
1211030031213 has 16 divisors (see below), whose sum is σ = 1819387843200. Its totient is φ = 795982178880.
The previous prime is 1211030031209. The next prime is 1211030031227. The reversal of 1211030031213 is 3121300301121.
1211030031213 is a `hidden beast` number, since 12 + 110 + 300 + 31 + 213 = 666.
It is not a de Polignac number, because 1211030031213 - 22 = 1211030031209 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1211030021213) 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 15 ways as a sum of consecutive naturals, for example, 315864028 + ... + 315867861.
It is an arithmetic number, because the mean of its divisors is an integer number (113711740200).
Almost surely, 21211030031213 is an apocalyptic number.
It is an amenable number.
1211030031213 is a deficient number, since it is larger than the sum of its proper divisors (608357811987).
1211030031213 is an equidigital number, since it uses as much as digits as its factorization.
1211030031213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 631731969 (or 631731963 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 1211030031213 its reverse (3121300301121), we get a palindrome (4332330332334).
The spelling of 1211030031213 in words is "one trillion, two hundred eleven billion, thirty million, thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •