Base | Representation |
---|---|
bin | 11111000000110110100… |
… | …111000110111001001101 |
3 | 21112202001101102112102102 |
4 | 133000312213012321031 |
5 | 234404214310002313 |
6 | 4311022521004445 |
7 | 306655422050504 |
oct | 37006647067115 |
9 | 7482041375372 |
10 | 2131220000333 |
11 | 751933147256 |
12 | 2a5065323725 |
13 | 125c86113998 |
14 | 75219db383b |
15 | 3a687ecca58 |
hex | 1f0369c6e4d |
2131220000333 has 8 divisors (see below), whose sum is σ = 2167819299360. Its totient is φ = 2094636598960.
The previous prime is 2131220000323. The next prime is 2131220000347. The reversal of 2131220000333 is 3330000221312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2131220000333 - 210 = 2131219999309 is a prime.
It is a super-2 number, since 2×21312200003332 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2131220000323) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3703838 + ... + 4240383.
It is an arithmetic number, because the mean of its divisors is an integer number (270977412420).
Almost surely, 22131220000333 is an apocalyptic number.
It is an amenable number.
2131220000333 is a deficient number, since it is larger than the sum of its proper divisors (36599299027).
2131220000333 is an equidigital number, since it uses as much as digits as its factorization.
2131220000333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7948827.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 2131220000333 its reverse (3330000221312), we get a palindrome (5461220221645).
The spelling of 2131220000333 in words is "two trillion, one hundred thirty-one billion, two hundred twenty million, three hundred thirty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.183 sec. • engine limits •