Base | Representation |
---|---|
bin | 110010101101110110101… |
… | …110100001010001101101 |
3 | 110100011221022012121212102 |
4 | 302231312232201101231 |
5 | 424100202324232334 |
6 | 11225030013544445 |
7 | 506540522316053 |
oct | 62556656412155 |
9 | 13304838177772 |
10 | 3485210383469 |
11 | 11240844473a1 |
12 | 483559aa5125 |
13 | 1c38668b3199 |
14 | c0983c1c1d3 |
15 | 609d1c6d67e |
hex | 32b76ba146d |
3485210383469 has 2 divisors, whose sum is σ = 3485210383470. Its totient is φ = 3485210383468.
The previous prime is 3485210383463. The next prime is 3485210383519. The reversal of 3485210383469 is 9643830125843.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2769435162244 + 715775221225 = 1664162^2 + 846035^2 .
It is a cyclic number.
It is not a de Polignac number, because 3485210383469 - 216 = 3485210317933 is a prime.
It is a super-2 number, since 2×34852103834692 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3485210383463) 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 as a sum of consecutive naturals, namely, 1742605191734 + 1742605191735.
It is an arithmetic number, because the mean of its divisors is an integer number (1742605191735).
Almost surely, 23485210383469 is an apocalyptic number.
It is an amenable number.
3485210383469 is a deficient number, since it is larger than the sum of its proper divisors (1).
3485210383469 is an equidigital number, since it uses as much as digits as its factorization.
3485210383469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14929920, while the sum is 56.
The spelling of 3485210383469 in words is "three trillion, four hundred eighty-five billion, two hundred ten million, three hundred eighty-three thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.595 sec. • engine limits •