Base | Representation |
---|---|
bin | 10011000101111111111… |
… | …110110100110111111011 |
3 | 11122102210100121000201000 |
4 | 103011333332310313323 |
5 | 132444201210414321 |
6 | 2442435342100043 |
7 | 163540235455350 |
oct | 23057776646773 |
9 | 4572710530630 |
10 | 1312112201211 |
11 | 466511149239 |
12 | 19236787a623 |
13 | 969685851c6 |
14 | 47714052627 |
15 | 241e745a826 |
hex | 1317ffb4dfb |
1312112201211 has 16 divisors (see below), whose sum is σ = 2221565632000. Its totient is φ = 749778400584.
The previous prime is 1312112201207. The next prime is 1312112201221. The reversal of 1312112201211 is 1121022112131.
It is a happy number.
1312112201211 is a `hidden beast` number, since 1 + 312 + 11 + 220 + 121 + 1 = 666.
It is not a de Polignac number, because 1312112201211 - 22 = 1312112201207 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1312112201201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3471196111 + ... + 3471196488.
It is an arithmetic number, because the mean of its divisors is an integer number (138847852000).
Almost surely, 21312112201211 is an apocalyptic number.
1312112201211 is a deficient number, since it is larger than the sum of its proper divisors (909453430789).
1312112201211 is an equidigital number, since it uses as much as digits as its factorization.
1312112201211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6942392615 (or 6942392609 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 1312112201211 its reverse (1121022112131), we get a palindrome (2433134313342).
The spelling of 1312112201211 in words is "one trillion, three hundred twelve billion, one hundred twelve million, two hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •