Base | Representation |
---|---|
bin | 100101100001011001001100… |
… | …1101000011011001110100011 |
3 | 1121021120222221121122012211021 |
4 | 1023002302121220123032203 |
5 | 321224424222331431110 |
6 | 3125540333353230311 |
7 | 126342652606250542 |
oct | 11302623150331643 |
9 | 1537528847565737 |
10 | 330045044405155 |
11 | 961873543458a2 |
12 | 31024b35702397 |
13 | 11221163a01b31 |
14 | 5b703a02d0159 |
15 | 2825367de82da |
hex | 12c2c99a1b3a3 |
330045044405155 has 8 divisors (see below), whose sum is σ = 396054336816000. Its totient is φ = 264035846504256.
The previous prime is 330045044405147. The next prime is 330045044405159. The reversal of 330045044405155 is 551504440540033.
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 330045044405155 - 23 = 330045044405147 is a prime.
It is not an unprimeable number, because it can be changed into a prime (330045044405159) 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 in 7 ways as a sum of consecutive naturals, for example, 15703090 + ... + 30111079.
It is an arithmetic number, because the mean of its divisors is an integer number (49506792102000).
Almost surely, 2330045044405155 is an apocalyptic number.
330045044405155 is a deficient number, since it is larger than the sum of its proper divisors (66009292410845).
330045044405155 is a wasteful number, since it uses less digits than its factorization.
330045044405155 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47254973.
The product of its (nonzero) digits is 1440000, while the sum is 43.
Adding to 330045044405155 its reverse (551504440540033), we get a palindrome (881549484945188).
The spelling of 330045044405155 in words is "three hundred thirty trillion, forty-five billion, forty-four million, four hundred five thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •