Base | Representation |
---|---|
bin | 101111110011110100100… |
… | …000010010011110111001 |
3 | 102122002100011012102002222 |
4 | 233303310200102132321 |
5 | 412312104010303121 |
6 | 10553152420133425 |
7 | 456236455510100 |
oct | 57636440223671 |
9 | 12562304172088 |
10 | 3285457119161 |
11 | 105739998a398 |
12 | 4508b0b37275 |
13 | 1aaa81732979 |
14 | b5034807037 |
15 | 5a6e02d60ab |
hex | 2fcf48127b9 |
3285457119161 has 6 divisors (see below), whose sum is σ = 3821858281530. Its totient is φ = 2816106102096.
The previous prime is 3285457119157. The next prime is 3285457119163. The reversal of 3285457119161 is 1619117545823.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 1918765188025 + 1366691931136 = 1385195^2 + 1169056^2 .
It is not a de Polignac number, because 3285457119161 - 22 = 3285457119157 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3285457119163) 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 5 ways as a sum of consecutive naturals, for example, 33525072596 + ... + 33525072693.
It is an arithmetic number, because the mean of its divisors is an integer number (636976380255).
Almost surely, 23285457119161 is an apocalyptic number.
It is an amenable number.
3285457119161 is a deficient number, since it is larger than the sum of its proper divisors (536401162369).
3285457119161 is an equidigital number, since it uses as much as digits as its factorization.
3285457119161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67050145303 (or 67050145296 counting only the distinct ones).
The product of its digits is 1814400, while the sum is 53.
The spelling of 3285457119161 in words is "three trillion, two hundred eighty-five billion, four hundred fifty-seven million, one hundred nineteen thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •