Base | Representation |
---|---|
bin | 110000000001101111110… |
… | …001111101100010110001 |
3 | 102200111221021011020101001 |
4 | 300001233301331202301 |
5 | 413033220011021231 |
6 | 11004104301442001 |
7 | 460306146155662 |
oct | 60015761754261 |
9 | 12614837136331 |
10 | 3300410251441 |
11 | 10627725aaa56 |
12 | 453784870301 |
13 | 1ac2c564c234 |
14 | b5a5270b369 |
15 | 5acb7e3db61 |
hex | 3006fc7d8b1 |
3300410251441 has 8 divisors (see below), whose sum is σ = 3335173412480. Its totient is φ = 3265662158208.
The previous prime is 3300410251423. The next prime is 3300410251499. The reversal of 3300410251441 is 1441520140033.
3300410251441 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3300410251441 - 211 = 3300410249393 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3300410051441) 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, 3326301 + ... + 4202986.
It is an arithmetic number, because the mean of its divisors is an integer number (416896676560).
Almost surely, 23300410251441 is an apocalyptic number.
It is an amenable number.
3300410251441 is a deficient number, since it is larger than the sum of its proper divisors (34763161039).
3300410251441 is an equidigital number, since it uses as much as digits as its factorization.
3300410251441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7533903.
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 3300410251441 its reverse (1441520140033), we get a palindrome (4741930391474).
The spelling of 3300410251441 in words is "three trillion, three hundred billion, four hundred ten million, two hundred fifty-one thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •