Base | Representation |
---|---|
bin | 1100010100000101… |
… | …0111111010001111 |
3 | 22112100211100122020 |
4 | 3011001113322033 |
5 | 23232200043011 |
6 | 1303555421223 |
7 | 144625021350 |
oct | 30501277217 |
9 | 8470740566 |
10 | 3305471631 |
11 | 1446941840 |
12 | 782bb4813 |
13 | 408a79997 |
14 | 235001d27 |
15 | 1452d4006 |
hex | c5057e8f |
3305471631 has 32 divisors (see below), whose sum is σ = 5499076608. Its totient is φ = 1715795040.
The previous prime is 3305471567. The next prime is 3305471639. The reversal of 3305471631 is 1361745033.
It is not a de Polignac number, because 3305471631 - 26 = 3305471567 is a prime.
It is a super-2 number, since 2×33054716312 = 21852285406691600322, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 3305471592 and 3305471601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3305471639) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 338686 + ... + 348308.
It is an arithmetic number, because the mean of its divisors is an integer number (171846144).
Almost surely, 23305471631 is an apocalyptic number.
3305471631 is a deficient number, since it is larger than the sum of its proper divisors (2193604977).
3305471631 is a wasteful number, since it uses less digits than its factorization.
3305471631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11131.
The product of its (nonzero) digits is 22680, while the sum is 33.
The square root of 3305471631 is about 57493.2311755045. The cubic root of 3305471631 is about 1489.6279465335.
The spelling of 3305471631 in words is "three billion, three hundred five million, four hundred seventy-one thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •