Base | Representation |
---|---|
bin | 10011000101001010010… |
… | …001001011010011010010 |
3 | 11122100110112220101200000 |
4 | 103011022101023103102 |
5 | 132440330011321002 |
6 | 2442210111110430 |
7 | 163506013651131 |
oct | 23051221132322 |
9 | 4570415811600 |
10 | 1311211042002 |
11 | 4660994a4a64 |
12 | 192155b12416 |
13 | 96853973cc4 |
14 | 4766a4b3918 |
15 | 241932a061c |
hex | 1314a44b4d2 |
1311211042002 has 48 divisors (see below), whose sum is σ = 3018035940192. Its totient is φ = 426410088480.
The previous prime is 1311211041991. The next prime is 1311211042003. The reversal of 1311211042002 is 2002401121131.
1311211042002 is a `hidden beast` number, since 1 + 31 + 1 + 211 + 0 + 420 + 0 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (1311211042003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 32882088 + ... + 32921939.
It is an arithmetic number, because the mean of its divisors is an integer number (62875748754).
Almost surely, 21311211042002 is an apocalyptic number.
1311211042002 is an abundant number, since it is smaller than the sum of its proper divisors (1706824898190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1311211042002 is an equidigital number, since it uses as much as digits as its factorization.
1311211042002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65804085 (or 65804073 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 1311211042002 its reverse (2002401121131), we get a palindrome (3313612163133).
The spelling of 1311211042002 in words is "one trillion, three hundred eleven billion, two hundred eleven million, forty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •