Base | Representation |
---|---|
bin | 100101100001110010111100… |
… | …0011100000111000000010000 |
3 | 1121021210021122000101020021020 |
4 | 1023003211320130013000100 |
5 | 321231330424424301222 |
6 | 3130021554450155440 |
7 | 126346650465033435 |
oct | 11303457034070020 |
9 | 1537707560336236 |
10 | 330100322103312 |
11 | 961a8840147662 |
12 | 310337a1b82b80 |
13 | 11226432cc0177 |
14 | 5b72d2592bb8c |
15 | 2826a00c9a65c |
hex | 12c3978707010 |
330100322103312 has 20 divisors (see below), whose sum is σ = 852759165433680. Its totient is φ = 110033440701088.
The previous prime is 330100322103221. The next prime is 330100322103323. The reversal of 330100322103312 is 213301223001033.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3438545021862 + ... + 3438545021957.
It is an arithmetic number, because the mean of its divisors is an integer number (42637958271684).
Almost surely, 2330100322103312 is an apocalyptic number.
It is an amenable number.
330100322103312 is an abundant number, since it is smaller than the sum of its proper divisors (522658843330368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
330100322103312 is a wasteful number, since it uses less digits than its factorization.
330100322103312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6877090043830 (or 6877090043824 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 330100322103312 its reverse (213301223001033), we get a palindrome (543401545104345).
The spelling of 330100322103312 in words is "three hundred thirty trillion, one hundred billion, three hundred twenty-two million, one hundred three thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •