Base | Representation |
---|---|
bin | 100101100010110100100000… |
… | …1011111101000100010101000 |
3 | 1121022021202002110011221121120 |
4 | 1023011221001133220202220 |
5 | 321241132320323413000 |
6 | 3130210403242135240 |
7 | 126363064110103461 |
oct | 11305510137504250 |
9 | 1538252073157546 |
10 | 330241134201000 |
11 | 96252529984810 |
12 | 31056b3b7b1520 |
13 | 112367b3bac629 |
14 | 5b79a82d53d68 |
15 | 282a4e2e336a0 |
hex | 12c5a417e88a8 |
330241134201000 has 128 divisors (see below), whose sum is σ = 1124020733247360. Its totient is φ = 80058456768000.
The previous prime is 330241134200993. The next prime is 330241134201031. The reversal of 330241134201000 is 102431142033.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5003620549 + ... + 5003686548.
It is an arithmetic number, because the mean of its divisors is an integer number (8781411978495).
Almost surely, 2330241134201000 is an apocalyptic number.
330241134201000 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
330241134201000 is an abundant number, since it is smaller than the sum of its proper divisors (793779599046360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
330241134201000 is a wasteful number, since it uses less digits than its factorization.
330241134201000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10007307132 (or 10007307118 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 330241134201000 its reverse (102431142033), we get a palindrome (330343565343033).
The spelling of 330241134201000 in words is "three hundred thirty trillion, two hundred forty-one billion, one hundred thirty-four million, two hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •