Base | Representation |
---|---|
bin | 100101101001110011100101… |
… | …0100010000011011110110000 |
3 | 1121102200112012212002201010220 |
4 | 1023103213022202003132300 |
5 | 321402400040010134412 |
6 | 3132223422540253040 |
7 | 126522332522322426 |
oct | 11323471242033660 |
9 | 1542615185081126 |
10 | 331201211021232 |
11 | 96592710250862 |
12 | 3119101b541180 |
13 | 112a61a8cb1876 |
14 | 5bb031d0a9116 |
15 | 28454847d968c |
hex | 12d39ca8837b0 |
331201211021232 has 80 divisors (see below), whose sum is σ = 902251812188160. Its totient is φ = 104402082422016.
The previous prime is 331201211021221. The next prime is 331201211021249. The reversal of 331201211021232 is 232120112102133.
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 (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 325487728 + ... + 326503695.
It is an arithmetic number, because the mean of its divisors is an integer number (11278147652352).
Almost surely, 2331201211021232 is an apocalyptic number.
It is an amenable number.
331201211021232 is an abundant number, since it is smaller than the sum of its proper divisors (571050601166928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
331201211021232 is a wasteful number, since it uses less digits than its factorization.
331201211021232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 651992010 (or 651992004 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 331201211021232 its reverse (232120112102133), we get a palindrome (563321323123365).
The spelling of 331201211021232 in words is "three hundred thirty-one trillion, two hundred one billion, two hundred eleven million, twenty-one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •