Base | Representation |
---|---|
bin | 100101100001110111100011… |
… | …0100101000111000100101100 |
3 | 1121021211020012000200221002121 |
4 | 1023003233012211013010230 |
5 | 321232011214043122312 |
6 | 3130030313133202324 |
7 | 126350451030322636 |
oct | 11303570645070454 |
9 | 1537736160627077 |
10 | 330110223020332 |
11 | 96201a60a37107 |
12 | 310356a59303a4 |
13 | 112273502c8351 |
14 | 5b735c485ba56 |
15 | 2826dd00d5707 |
hex | 12c3bc694712c |
330110223020332 has 24 divisors (see below), whose sum is σ = 608683051558400. Its totient is φ = 156217501784016.
The previous prime is 330110223020321. The next prime is 330110223020339. The reversal of 330110223020332 is 233020322011033.
It is a super-2 number, since 2×3301102230203322 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 330110223020297 and 330110223020306.
It is not an unprimeable number, because it can be changed into a prime (330110223020339) 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, 2090178768 + ... + 2090336695.
Almost surely, 2330110223020332 is an apocalyptic number.
It is an amenable number.
330110223020332 is a deficient number, since it is larger than the sum of its proper divisors (278572828538068).
330110223020332 is a wasteful number, since it uses less digits than its factorization.
330110223020332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4180516525 (or 4180516523 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 330110223020332 its reverse (233020322011033), we get a palindrome (563130545031365).
The spelling of 330110223020332 in words is "three hundred thirty trillion, one hundred ten billion, two hundred twenty-three million, twenty thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •