Base | Representation |
---|---|
bin | 11111001110100011110… |
… | …11110000010010111001 |
3 | 10210120112001101121200001 |
4 | 33213101323300102321 |
5 | 120034420023143121 |
6 | 2140525400313001 |
7 | 140343112446211 |
oct | 17472173602271 |
9 | 3716461347601 |
10 | 1072968959161 |
11 | 384053006a20 |
12 | 153b47172761 |
13 | 7a246849a58 |
14 | 39d094a5241 |
15 | 1cd9c838991 |
hex | f9d1ef04b9 |
1072968959161 has 16 divisors (see below), whose sum is σ = 1185478698240. Its totient is φ = 962956874880.
The previous prime is 1072968959147. The next prime is 1072968959173. The reversal of 1072968959161 is 1619598692701.
It is not a de Polignac number, because 1072968959161 - 25 = 1072968959129 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1072968959093 and 1072968959102.
It is not an unprimeable number, because it can be changed into a prime (1072968950161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7153245 + ... + 7301701.
It is an arithmetic number, because the mean of its divisors is an integer number (74092418640).
Almost surely, 21072968959161 is an apocalyptic number.
1072968959161 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1072968959161 is a deficient number, since it is larger than the sum of its proper divisors (112509739079).
1072968959161 is a wasteful number, since it uses less digits than its factorization.
1072968959161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156864.
The product of its (nonzero) digits is 14696640, while the sum is 64.
The spelling of 1072968959161 in words is "one trillion, seventy-two billion, nine hundred sixty-eight million, nine hundred fifty-nine thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •