Base | Representation |
---|---|
bin | 10111001110000101100101… |
… | …000000011110101010101101 |
3 | 111101120212122122210011102121 |
4 | 113032011211000132222231 |
5 | 101341141133244141141 |
6 | 1001110415202152541 |
7 | 30340103261435440 |
oct | 2716054500365255 |
9 | 441525578704377 |
10 | 102123132021421 |
11 | 2a5a31a4755135 |
12 | b554192352751 |
13 | 44ca229721794 |
14 | 1b30b00979657 |
15 | bc16cc6c41d1 |
hex | 5ce16501eaad |
102123132021421 has 32 divisors (see below), whose sum is σ = 118377680256000. Its totient is φ = 86291034141312.
The previous prime is 102123132021401. The next prime is 102123132021433. The reversal of 102123132021421 is 124120231321201.
It is not a de Polignac number, because 102123132021421 - 211 = 102123132019373 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102123132021401) 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 31 ways as a sum of consecutive naturals, for example, 665537110 + ... + 665690536.
It is an arithmetic number, because the mean of its divisors is an integer number (3699302508000).
Almost surely, 2102123132021421 is an apocalyptic number.
It is an amenable number.
102123132021421 is a deficient number, since it is larger than the sum of its proper divisors (16254548234579).
102123132021421 is a wasteful number, since it uses less digits than its factorization.
102123132021421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156721.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 102123132021421 its reverse (124120231321201), we get a palindrome (226243363342622).
The spelling of 102123132021421 in words is "one hundred two trillion, one hundred twenty-three billion, one hundred thirty-two million, twenty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.176 sec. • engine limits •