Base | Representation |
---|---|
bin | 110000000011111011… |
… | …1001110100011001011 |
3 | 100212101221221210210102 |
4 | 1200013313032203023 |
5 | 3142334022230011 |
6 | 115225312440015 |
7 | 10312445104451 |
oct | 1400767164313 |
9 | 325357853712 |
10 | 103211133131 |
11 | 3a853aa2a37 |
12 | 1800524900b |
13 | 996ab78812 |
14 | 4dd17069d1 |
15 | 2a410d673b |
hex | 1807dce8cb |
103211133131 has 8 divisors (see below), whose sum is σ = 103354093584. Its totient is φ = 103068232960.
The previous prime is 103211133127. The next prime is 103211133191. The reversal of 103211133131 is 131331112301.
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 103211133131 - 22 = 103211133127 is a prime.
It is a super-2 number, since 2×1032111331312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103211133191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4205111 + ... + 4229583.
It is an arithmetic number, because the mean of its divisors is an integer number (12919261698).
Almost surely, 2103211133131 is an apocalyptic number.
103211133131 is a deficient number, since it is larger than the sum of its proper divisors (142960453).
103211133131 is an equidigital number, since it uses as much as digits as its factorization.
103211133131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30141.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 103211133131 its reverse (131331112301), we get a palindrome (234542245432).
The spelling of 103211133131 in words is "one hundred three billion, two hundred eleven million, one hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •