Base | Representation |
---|---|
bin | 101111100011110001… |
… | …0101111111101010001 |
3 | 100202121202102100011000 |
4 | 1133013202233331101 |
5 | 3133131244214441 |
6 | 114530243412213 |
7 | 10243632605232 |
oct | 1370742577521 |
9 | 322552370130 |
10 | 102132023121 |
11 | 3a34a956687 |
12 | 17963984069 |
13 | 982843039b |
14 | 4d2c285089 |
15 | 29cb4ca2b6 |
hex | 17c78aff51 |
102132023121 has 32 divisors (see below), whose sum is σ = 158748093440. Its totient is φ = 64811404800.
The previous prime is 102132023111. The next prime is 102132023137. The reversal of 102132023121 is 121320231201.
102132023121 is a `hidden beast` number, since 10 + 21 + 320 + 2 + 312 + 1 = 666.
It is not a de Polignac number, because 102132023121 - 211 = 102132021073 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102132023094 and 102132023103.
It is not an unprimeable number, because it can be changed into a prime (102132023111) 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, 949120 + ... + 1051233.
It is an arithmetic number, because the mean of its divisors is an integer number (4960877920).
Almost surely, 2102132023121 is an apocalyptic number.
It is an amenable number.
102132023121 is a deficient number, since it is larger than the sum of its proper divisors (56616070319).
102132023121 is a wasteful number, since it uses less digits than its factorization.
102132023121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2000454 (or 2000448 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 102132023121 its reverse (121320231201), we get a palindrome (223452254322).
The spelling of 102132023121 in words is "one hundred two billion, one hundred thirty-two million, twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •