Base | Representation |
---|---|
bin | 10111001100101110110101… |
… | …111111000011110011011011 |
3 | 111101020222021012221111202022 |
4 | 113030232311333003303123 |
5 | 101333124420314320402 |
6 | 1000555534024125055 |
7 | 30330265355530055 |
oct | 2714566577036333 |
9 | 441228235844668 |
10 | 102030001323227 |
11 | 2a56775391516a |
12 | b53a12100678b |
13 | 44c1507116783 |
14 | 1b2a3c7d728d5 |
15 | bbe07b5882a2 |
hex | 5ccbb5fc3cdb |
102030001323227 has 2 divisors, whose sum is σ = 102030001323228. Its totient is φ = 102030001323226.
The previous prime is 102030001323197. The next prime is 102030001323259. The reversal of 102030001323227 is 722323100030201.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (722323100030201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102030001323227 - 26 = 102030001323163 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102030001323196 and 102030001323205.
It is not a weakly prime, because it can be changed into another prime (102030001323727) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51015000661613 + 51015000661614.
It is an arithmetic number, because the mean of its divisors is an integer number (51015000661614).
Almost surely, 2102030001323227 is an apocalyptic number.
102030001323227 is a deficient number, since it is larger than the sum of its proper divisors (1).
102030001323227 is an equidigital number, since it uses as much as digits as its factorization.
102030001323227 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 26.
Adding to 102030001323227 its reverse (722323100030201), we get a palindrome (824353101353428).
The spelling of 102030001323227 in words is "one hundred two trillion, thirty billion, one million, three hundred twenty-three thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •