Base | Representation |
---|---|
bin | 10111001111101010000011… |
… | …001111000000101110011101 |
3 | 111101222012010002111110022102 |
4 | 113033222003033000232131 |
5 | 101344423103403023241 |
6 | 1001232140145054445 |
7 | 30350642545432445 |
oct | 2717520317005635 |
9 | 441865102443272 |
10 | 102231013329821 |
11 | 2a634a2495a952 |
12 | b57107b627425 |
13 | 450745ccb7acc |
14 | 1b36016609125 |
15 | bc43e37b139b |
hex | 5cfa833c0b9d |
102231013329821 has 2 divisors, whose sum is σ = 102231013329822. Its totient is φ = 102231013329820.
The previous prime is 102231013329701. The next prime is 102231013329839. The reversal of 102231013329821 is 128923310132201.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 93017730484900 + 9213282844921 = 9644570^2 + 3035339^2 .
It is a cyclic number.
It is not a de Polignac number, because 102231013329821 - 222 = 102231009135517 is a prime.
It is a super-2 number, since 2×1022310133298212 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102231013379821) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51115506664910 + 51115506664911.
It is an arithmetic number, because the mean of its divisors is an integer number (51115506664911).
Almost surely, 2102231013329821 is an apocalyptic number.
It is an amenable number.
102231013329821 is a deficient number, since it is larger than the sum of its proper divisors (1).
102231013329821 is an equidigital number, since it uses as much as digits as its factorization.
102231013329821 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 38.
The spelling of 102231013329821 in words is "one hundred two trillion, two hundred thirty-one billion, thirteen million, three hundred twenty-nine thousand, eight hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •