Base | Representation |
---|---|
bin | 1001100111000110101… |
… | …11001001110100000000 |
3 | 1011120101102210100210110 |
4 | 10303203113021310000 |
5 | 20402303343341112 |
6 | 411412334031320 |
7 | 32600312534166 |
oct | 4634327116400 |
9 | 1146342710713 |
10 | 330232012032 |
11 | 1180613a840a |
12 | 54002048540 |
13 | 251aa2a8a20 |
14 | 11daa303236 |
15 | 88cb86713c |
hex | 4ce35c9d00 |
330232012032 has 144 divisors (see below), whose sum is σ = 952317816128. Its totient is φ = 100985978880.
The previous prime is 330232011979. The next prime is 330232012043. The reversal of 330232012032 is 230210232033.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1525932 + ... + 1728852.
Almost surely, 2330232012032 is an apocalyptic number.
330232012032 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 330232012032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (476158908064).
330232012032 is an abundant number, since it is smaller than the sum of its proper divisors (622085804096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
330232012032 is a wasteful number, since it uses less digits than its factorization.
330232012032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 203116 (or 203102 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 330232012032 its reverse (230210232033), we get a palindrome (560442244065).
The spelling of 330232012032 in words is "three hundred thirty billion, two hundred thirty-two million, twelve thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •