Base | Representation |
---|---|
bin | 101111110100000001001… |
… | …101001100010110101011 |
3 | 102122002220000011220120101 |
4 | 233310001031030112223 |
5 | 412313023033422011 |
6 | 10553225511410231 |
7 | 456244654016011 |
oct | 57640115142653 |
9 | 12562800156511 |
10 | 3285670217131 |
11 | 10574991a9015 |
12 | 450950383977 |
13 | 1aaab6924943 |
14 | b5054c388b1 |
15 | 5a703d7b2c1 |
hex | 2fd0134c5ab |
3285670217131 has 2 divisors, whose sum is σ = 3285670217132. Its totient is φ = 3285670217130.
The previous prime is 3285670217051. The next prime is 3285670217177. The reversal of 3285670217131 is 1317120765823.
3285670217131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (3285670217177) can be obtained adding 3285670217131 to its sum of digits (46).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3285670217131 - 27 = 3285670217003 is a prime.
It is a super-2 number, since 2×32856702171312 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3285670217831) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1642835108565 + 1642835108566.
It is an arithmetic number, because the mean of its divisors is an integer number (1642835108566).
Almost surely, 23285670217131 is an apocalyptic number.
3285670217131 is a deficient number, since it is larger than the sum of its proper divisors (1).
3285670217131 is an equidigital number, since it uses as much as digits as its factorization.
3285670217131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 423360, while the sum is 46.
The spelling of 3285670217131 in words is "three trillion, two hundred eighty-five billion, six hundred seventy million, two hundred seventeen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •