Base | Representation |
---|---|
bin | 101111110001110011010… |
… | …100111001100100000001 |
3 | 102121212202010010212210100 |
4 | 233301303110321210001 |
5 | 412243134201411031 |
6 | 10552153400353013 |
7 | 456131661305112 |
oct | 57616324714401 |
9 | 12555663125710 |
10 | 3283289872641 |
11 | 10564875a0a69 |
12 | 4503a7175769 |
13 | 1aa7c772b68c |
14 | b4caaa54209 |
15 | 5a614dd8de6 |
hex | 2fc73539901 |
3283289872641 has 12 divisors (see below), whose sum is σ = 4992136648720. Its totient is φ = 2073656761560.
The previous prime is 3283289872637. The next prime is 3283289872673. The reversal of 3283289872641 is 1462789823823.
3283289872641 is a `hidden beast` number, since 3 + 283 + 2 + 8 + 98 + 7 + 264 + 1 = 666.
3283289872641 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3283289872641 - 22 = 3283289872637 is a prime.
It is a super-3 number, since 3×32832898726413 (a number of 39 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3283289873641) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9600262615 + ... + 9600262956.
Almost surely, 23283289872641 is an apocalyptic number.
It is an amenable number.
3283289872641 is a deficient number, since it is larger than the sum of its proper divisors (1708846776079).
3283289872641 is a wasteful number, since it uses less digits than its factorization.
3283289872641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19200525596 (or 19200525593 counting only the distinct ones).
The product of its digits is 55738368, while the sum is 63.
The spelling of 3283289872641 in words is "three trillion, two hundred eighty-three billion, two hundred eighty-nine million, eight hundred seventy-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •