Base | Representation |
---|---|
bin | 100101101000011011011110… |
… | …0101100000101110011010101 |
3 | 1121102000102211102120121102102 |
4 | 1023100312330230011303111 |
5 | 321341300034023211013 |
6 | 3132000451424051445 |
7 | 126502553641055564 |
oct | 11320667454056325 |
9 | 1542012742517372 |
10 | 331012000210133 |
11 | 9651a445720a00 |
12 | 31160415163b85 |
13 | 112913b4018c48 |
14 | 5ba50cdc9dbdb |
15 | 28405ad661d58 |
hex | 12d0dbcb05cd5 |
331012000210133 has 24 divisors (see below), whose sum is σ = 369811148488320. Its totient is φ = 295981340608800.
The previous prime is 331012000210097. The next prime is 331012000210147.
331012000210133 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 331012000210133 - 210 = 331012000209109 is a prime.
It is a super-2 number, since 2×3310120002101332 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (331012000215133) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 422443928 + ... + 423226766.
It is an arithmetic number, because the mean of its divisors is an integer number (15408797853680).
Almost surely, 2331012000210133 is an apocalyptic number.
It is an amenable number.
331012000210133 is a deficient number, since it is larger than the sum of its proper divisors (38799148278187).
331012000210133 is a wasteful number, since it uses less digits than its factorization.
331012000210133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 840209 (or 840198 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 20.
It can be divided in two parts, 331012000 and 210133, that added together give a palindrome (331222133).
The spelling of 331012000210133 in words is "three hundred thirty-one trillion, twelve billion, two hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •