Base | Representation |
---|---|
bin | 101111100011110001… |
… | …1110110100100001011 |
3 | 100202121202222000212111 |
4 | 1133013203312210023 |
5 | 3133131332443311 |
6 | 114530253523151 |
7 | 10243635221350 |
oct | 1370743664413 |
9 | 322552860774 |
10 | 102132312331 |
11 | 3a3500339a5 |
12 | 17963aa34b7 |
13 | 9828501c0a |
14 | 4d2c31c627 |
15 | 29cb535d21 |
hex | 17c78f690b |
102132312331 has 4 divisors (see below), whose sum is σ = 116722642672. Its totient is φ = 87541981992.
The previous prime is 102132312323. The next prime is 102132312367. The reversal of 102132312331 is 133213231201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 133213231201 = 631 ⋅211114471.
It is a cyclic number.
It is not a de Polignac number, because 102132312331 - 23 = 102132312323 is a prime.
It is a super-2 number, since 2×1021323123312 (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 (102132312301) 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, 7295165160 + ... + 7295165173.
It is an arithmetic number, because the mean of its divisors is an integer number (29180660668).
Almost surely, 2102132312331 is an apocalyptic number.
102132312331 is a deficient number, since it is larger than the sum of its proper divisors (14590330341).
102132312331 is an equidigital number, since it uses as much as digits as its factorization.
102132312331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14590330340.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 102132312331 its reverse (133213231201), we get a palindrome (235345543532).
The spelling of 102132312331 in words is "one hundred two billion, one hundred thirty-two million, three hundred twelve thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •