Base | Representation |
---|---|
bin | 100101101001001001100101… |
… | …0101111011111110101010100 |
3 | 1121102100220102022012220102110 |
4 | 1023102103022233133311110 |
5 | 321344410332134411040 |
6 | 3132114145222511020 |
7 | 126512660515263210 |
oct | 11322231257376524 |
9 | 1542326368186373 |
10 | 331111020232020 |
11 | 96558438968a36 |
12 | 3117764a895470 |
13 | 1129a8347ab882 |
14 | 5ba9c04b05940 |
15 | 2842e56822980 |
hex | 12d24cabdfd54 |
331111020232020 has 96 divisors (see below), whose sum is σ = 1069842209200128. Its totient is φ = 74947737163392.
The previous prime is 331111020231997. The next prime is 331111020232067. The reversal of 331111020232020 is 20232020111133.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
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, 3826944954 + ... + 3827031473.
It is an arithmetic number, because the mean of its divisors is an integer number (11144189679168).
Almost surely, 2331111020232020 is an apocalyptic number.
331111020232020 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
331111020232020 is an abundant number, since it is smaller than the sum of its proper divisors (738731188968108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
331111020232020 is a wasteful number, since it uses less digits than its factorization.
331111020232020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7653976549 (or 7653976547 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 331111020232020 its reverse (20232020111133), we get a palindrome (351343040343153).
The spelling of 331111020232020 in words is "three hundred thirty-one trillion, one hundred eleven billion, twenty million, two hundred thirty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •