Base | Representation |
---|---|
bin | 101111110011111101011… |
… | …011110111001000001001 |
3 | 102122002201121010210011020 |
4 | 233303331123313020021 |
5 | 412312410340002411 |
6 | 10553215331423053 |
7 | 456243255206616 |
oct | 57637533671011 |
9 | 12562647123136 |
10 | 3285606953481 |
11 | 1057466519106 |
12 | 450933154a89 |
13 | 1aaaa67a4328 |
14 | b504a68b50d |
15 | 5a6ed531606 |
hex | 2fcfd6f7209 |
3285606953481 has 8 divisors (see below), whose sum is σ = 4380935444160. Its totient is φ = 2190341549232.
The previous prime is 3285606953477. The next prime is 3285606953509. The reversal of 3285606953481 is 1843596065823.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3285606953481 - 22 = 3285606953477 is a prime.
It is a super-2 number, since 2×32856069534812 (a number of 26 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (60) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (3285606953281) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15649950 + ... + 15858503.
It is an arithmetic number, because the mean of its divisors is an integer number (547616930520).
Almost surely, 23285606953481 is an apocalyptic number.
It is an amenable number.
3285606953481 is a deficient number, since it is larger than the sum of its proper divisors (1095328490679).
3285606953481 is a wasteful number, since it uses less digits than its factorization.
3285606953481 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31543215.
The product of its (nonzero) digits is 37324800, while the sum is 60.
The spelling of 3285606953481 in words is "three trillion, two hundred eighty-five billion, six hundred six million, nine hundred fifty-three thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •