Base | Representation |
---|---|
bin | 111111011110000100… |
… | …101001110001001001 |
3 | 20111220111202110202221 |
4 | 333132010221301021 |
5 | 2104032432133144 |
6 | 51150252454041 |
7 | 4631553513610 |
oct | 773604516111 |
9 | 214814673687 |
10 | 68150271049 |
11 | 269a2062363 |
12 | 1125b47a321 |
13 | 6571165693 |
14 | 34270b6877 |
15 | 1b8d032d84 |
hex | fde129c49 |
68150271049 has 64 divisors (see below), whose sum is σ = 88438210560. Its totient is φ = 51174573120.
The previous prime is 68150271043. The next prime is 68150271097. The reversal of 68150271049 is 94017205186.
It is not a de Polignac number, because 68150271049 - 25 = 68150271017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 68150270996 and 68150271014.
It is not an unprimeable number, because it can be changed into a prime (68150271043) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 11930304 + ... + 11936014.
It is an arithmetic number, because the mean of its divisors is an integer number (1381847040).
Almost surely, 268150271049 is an apocalyptic number.
It is an amenable number.
68150271049 is a deficient number, since it is larger than the sum of its proper divisors (20287939511).
68150271049 is a wasteful number, since it uses less digits than its factorization.
68150271049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5890.
The product of its (nonzero) digits is 120960, while the sum is 43.
The spelling of 68150271049 in words is "sixty-eight billion, one hundred fifty million, two hundred seventy-one thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •