Base | Representation |
---|---|
bin | 10111011011001010000000… |
… | …000000101000001100001111 |
3 | 111111202201210212121122020201 |
4 | 113123022000000220030033 |
5 | 102000344441200211002 |
6 | 1003035145015354331 |
7 | 30462016124540131 |
oct | 2733120000501417 |
9 | 444681725548221 |
10 | 103021233210127 |
11 | 2a90a0724309a1 |
12 | b67a2566829a7 |
13 | 4563b259a20bb |
14 | 1b6237bac7051 |
15 | bd9c4317a087 |
hex | 5db28002830f |
103021233210127 has 2 divisors, whose sum is σ = 103021233210128. Its totient is φ = 103021233210126.
The previous prime is 103021233209963. The next prime is 103021233210151. The reversal of 103021233210127 is 721012332120301.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 103021233210127 - 223 = 103021224821519 is a prime.
It is a super-2 number, since 2×1030212332101272 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103021233210095 and 103021233210104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103021233210227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51510616605063 + 51510616605064.
It is an arithmetic number, because the mean of its divisors is an integer number (51510616605064).
Almost surely, 2103021233210127 is an apocalyptic number.
103021233210127 is a deficient number, since it is larger than the sum of its proper divisors (1).
103021233210127 is an equidigital number, since it uses as much as digits as its factorization.
103021233210127 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3024, while the sum is 28.
Adding to 103021233210127 its reverse (721012332120301), we get a palindrome (824033565330428).
The spelling of 103021233210127 in words is "one hundred three trillion, twenty-one billion, two hundred thirty-three million, two hundred ten thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •