Base | Representation |
---|---|
bin | 10111001110001110000010… |
… | …110001000100001111011011 |
3 | 111101121202010002201220110211 |
4 | 113032032002301010033123 |
5 | 101341313242113411331 |
6 | 1001114521131351551 |
7 | 30340544436444061 |
oct | 2716160261041733 |
9 | 441552102656424 |
10 | 102132221232091 |
11 | 2a5a7039338696 |
12 | b555aaa2b25b7 |
13 | 44cb04780864b |
14 | 1b31323b74031 |
15 | bc1a606238b1 |
hex | 5ce382c443db |
102132221232091 has 6 divisors (see below), whose sum is σ = 106765819171340. Its totient is φ = 97691689873668.
The previous prime is 102132221232077. The next prime is 102132221232203. The reversal of 102132221232091 is 190232122231201.
It is not a de Polignac number, because 102132221232091 - 217 = 102132221101019 is a prime.
It is a super-2 number, since 2×1021322212320912 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102132221232791) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 96533289861 + ... + 96533290918.
Almost surely, 2102132221232091 is an apocalyptic number.
102132221232091 is a deficient number, since it is larger than the sum of its proper divisors (4633597939249).
102132221232091 is an equidigital number, since it uses as much as digits as its factorization.
102132221232091 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 193066580825 (or 193066580802 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 31.
Adding to 102132221232091 its reverse (190232122231201), we get a palindrome (292364343463292).
The spelling of 102132221232091 in words is "one hundred two trillion, one hundred thirty-two billion, two hundred twenty-one million, two hundred thirty-two thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •