Base | Representation |
---|---|
bin | 10001101011010010000… |
… | …101000101111001000010 |
3 | 11022010100220101011020110 |
4 | 101223102011011321002 |
5 | 124400204030441212 |
6 | 2330010010452150 |
7 | 153521346632340 |
oct | 21532205057102 |
9 | 4263326334213 |
10 | 1214705327682 |
11 | 429176543470 |
12 | 177502434056 |
13 | 8a71407cc32 |
14 | 42b13564990 |
15 | 218e5be4a3c |
hex | 11ad2145e42 |
1214705327682 has 128 divisors (see below), whose sum is σ = 3136891650048. Its totient is φ = 304445332800.
The previous prime is 1214705327681. The next prime is 1214705327701. The reversal of 1214705327682 is 2867235074121.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (1214705327681) 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 63 ways as a sum of consecutive naturals, for example, 1147743 + ... + 1935645.
It is an arithmetic number, because the mean of its divisors is an integer number (24506966016).
Almost surely, 21214705327682 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1214705327682, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1568445825024).
1214705327682 is an abundant number, since it is smaller than the sum of its proper divisors (1922186322366).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1214705327682 is a wasteful number, since it uses less digits than its factorization.
1214705327682 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 788044.
The product of its (nonzero) digits is 1128960, while the sum is 48.
The spelling of 1214705327682 in words is "one trillion, two hundred fourteen billion, seven hundred five million, three hundred twenty-seven thousand, six hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •