Base | Representation |
---|---|
bin | 100101101111110101111110… |
… | …1111000011000011000000011 |
3 | 1121112121212001100201100001202 |
4 | 1023133223331320120120003 |
5 | 322004443442301401011 |
6 | 3134100534115451415 |
7 | 126636306510423122 |
oct | 11337537570303003 |
9 | 1545555040640052 |
10 | 332031001200131 |
11 | 96882614168912 |
12 | 312a59ba5b6b6b |
13 | 11336509a0aa1c |
14 | 5bdc559a5bab9 |
15 | 285bd4d0ab23b |
hex | 12dfafde18603 |
332031001200131 has 4 divisors (see below), whose sum is σ = 332031098719872. Its totient is φ = 332030903680392.
The previous prime is 332031001200091. The next prime is 332031001200133. The reversal of 332031001200131 is 131002100130233.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-332031001200131 is a prime.
It is a super-2 number, since 2×3320310012001312 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (332031001200133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43460771 + ... + 50526236.
It is an arithmetic number, because the mean of its divisors is an integer number (83007774679968).
Almost surely, 2332031001200131 is an apocalyptic number.
332031001200131 is a deficient number, since it is larger than the sum of its proper divisors (97519741).
332031001200131 is an equidigital number, since it uses as much as digits as its factorization.
332031001200131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97519740.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 332031001200131 its reverse (131002100130233), we get a palindrome (463033101330364).
The spelling of 332031001200131 in words is "three hundred thirty-two trillion, thirty-one billion, one million, two hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •