Base | Representation |
---|---|
bin | 101111100000110111… |
… | …0010110111110011011 |
3 | 100202100221201201211101 |
4 | 1133001232112332123 |
5 | 3132431301400402 |
6 | 114512435212231 |
7 | 10241336055151 |
oct | 1370156267633 |
9 | 322327651741 |
10 | 102034403227 |
11 | 3a2aa840389 |
12 | 17937147077 |
13 | 9811141033 |
14 | 4d1d3133d1 |
15 | 29c2b45b87 |
hex | 17c1b96f9b |
102034403227 has 2 divisors, whose sum is σ = 102034403228. Its totient is φ = 102034403226.
The previous prime is 102034403183. The next prime is 102034403279. The reversal of 102034403227 is 722304430201.
It is a weak prime.
It is an emirp because it is prime and its reverse (722304430201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102034403227 is a prime.
It is a super-2 number, since 2×1020344032272 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102034403195 and 102034403204.
It is not a weakly prime, because it can be changed into another prime (102034403827) 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 as a sum of consecutive naturals, namely, 51017201613 + 51017201614.
It is an arithmetic number, because the mean of its divisors is an integer number (51017201614).
Almost surely, 2102034403227 is an apocalyptic number.
102034403227 is a deficient number, since it is larger than the sum of its proper divisors (1).
102034403227 is an equidigital number, since it uses as much as digits as its factorization.
102034403227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064, while the sum is 28.
Adding to 102034403227 its reverse (722304430201), we get a palindrome (824338833428).
The spelling of 102034403227 in words is "one hundred two billion, thirty-four million, four hundred three thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •