Base | Representation |
---|---|
bin | 1001101000101110100… |
… | …10100000111000000100 |
3 | 1011122122011002212010100 |
4 | 10310113102200320010 |
5 | 20411044410223022 |
6 | 412035014524100 |
7 | 32631021600000 |
oct | 4642722407004 |
9 | 1148564085110 |
10 | 331103211012 |
11 | 118469149072 |
12 | 54205966630 |
13 | 252b892a092 |
14 | 1204dcc3700 |
15 | 892d0a51ac |
hex | 4d174a0e04 |
331103211012 has 216 divisors, whose sum is σ = 992557430592. Its totient is φ = 93039710400.
The previous prime is 331103210957. The next prime is 331103211013. The reversal of 331103211012 is 210112301133.
331103211012 is a `hidden beast` number, since 331 + 1 + 0 + 321 + 1 + 0 + 12 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (331103211013) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 36903687 + ... + 36912657.
Almost surely, 2331103211012 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 331103211012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (496278715296).
331103211012 is an abundant number, since it is smaller than the sum of its proper divisors (661454219580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
331103211012 is an equidigital number, since it uses as much as digits as its factorization.
331103211012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9077 (or 9044 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 331103211012 its reverse (210112301133), we get a palindrome (541215512145).
The spelling of 331103211012 in words is "three hundred thirty-one billion, one hundred three million, two hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.353 sec. • engine limits •