Base | Representation |
---|---|
bin | 10001011110101101110… |
… | …000010111100011000000 |
3 | 11020211112110102221221100 |
4 | 101132231300113203000 |
5 | 124140040004411222 |
6 | 2315455000454400 |
7 | 152533062101052 |
oct | 21365560274300 |
9 | 4224473387840 |
10 | 1201211013312 |
11 | 423481335342 |
12 | 17497717a400 |
13 | 8937346702b |
14 | 421d32c38d2 |
15 | 213a619e4ac |
hex | 117adc178c0 |
1201211013312 has 42 divisors (see below), whose sum is σ = 3443054485988. Its totient is φ = 400403670912.
The previous prime is 1201211013287. The next prime is 1201211013349. The reversal of 1201211013312 is 2133101121021.
1201211013312 is a `hidden beast` number, since 120 + 1 + 211 + 0 + 1 + 331 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1042717318 + ... + 1042718469.
Almost surely, 21201211013312 is an apocalyptic number.
1201211013312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1201211013312 is an abundant number, since it is smaller than the sum of its proper divisors (2241843472676).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1201211013312 is a wasteful number, since it uses less digits than its factorization.
1201211013312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2085435805 (or 2085435792 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 1201211013312 its reverse (2133101121021), we get a palindrome (3334312134333).
The spelling of 1201211013312 in words is "one trillion, two hundred one billion, two hundred eleven million, thirteen thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •