Base | Representation |
---|---|
bin | 100101101001010010111100… |
… | …1100100000101011010101100 |
3 | 1121102102211100000011120220201 |
4 | 1023102211321210011122230 |
5 | 321400223030034402340 |
6 | 3132131313103523244 |
7 | 126514302111110104 |
oct | 11322457144053254 |
9 | 1542384300146821 |
10 | 331131133122220 |
11 | 96565a1a093042 |
12 | 3117b5225b9524 |
13 | 1129c6bb691232 |
14 | 5baab91db6204 |
15 | 284373243c79a |
hex | 12d29799056ac |
331131133122220 has 24 divisors (see below), whose sum is σ = 695380948743600. Its totient is φ = 132451392451392.
The previous prime is 331131133122211. The next prime is 331131133122227. The reversal of 331131133122220 is 22221331131133.
It is not an unprimeable number, because it can be changed into a prime (331131133122227) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 63737775 + ... + 68736934.
It is an arithmetic number, because the mean of its divisors is an integer number (28974206197650).
Almost surely, 2331131133122220 is an apocalyptic number.
It is an amenable number.
331131133122220 is an abundant number, since it is smaller than the sum of its proper divisors (364249815621380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
331131133122220 is a wasteful number, since it uses less digits than its factorization.
331131133122220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132599697 (or 132599695 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 28.
Adding to 331131133122220 its reverse (22221331131133), we get a palindrome (353352464253353).
The spelling of 331131133122220 in words is "three hundred thirty-one trillion, one hundred thirty-one billion, one hundred thirty-three million, one hundred twenty-two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •